# Tag Archives: sort

## Write a program to sort data using a selection sort algorithm – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-045 Course Title : Introduction to Algorithm Design Lab Assignment Number : BCA(IV)/L-045/Assignment/2015 Maximum Marks : 50 Weightage : 25% Write a program to sort data using a selection sort algorithm. #include<stdio.h> void main() { int MIN,MIN_POS,I,J,TEMP,List[]={6,3,0,4,8,2,5,9,1,7}; int N=10; clrscr(); printf(“\n****SELECTION SORT****\n”); printf(“\n\nList Before Sorting :\n\n”); for(J=0;J<N;J++) {… Read More »

## Implement merge sort algorithm – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-045 Course Title : Introduction to Algorithm Design Lab Assignment Number : BCA(IV)/L-045/Assignment/2015 Maximum Marks : 50 Weightage : 25% Implement merge sort algorithm.   #include<stdio.h> int numbers[10]={2,8,4,1,0,7,9,3,5,6}; int temp[10],array_size=10; void mergeSort(int numbers[],int temp[],int array_size); void m_sort(int numbers[],int temp[],int left,int right); void merge(int numbers[],int temp[],int left,int mid,int right);… Read More »

## Draw a flow chart and write a program in C to sort a given list of numbers. 7m Jun2007

Draw a flow chart and write a program in C to sort a given list of numbers. 7m Jun2007   Flowchart: Code: #include<stdio.h> void main() { int I,J,Temp,List[]={6,3,0,4,8,2,5,9,1,7}; clrscr(); printf(“List Before Sorting :\n”); for(J=0;J<10;J++) { printf(“%d “,List[J]); } for(I=0;I<10;I++) { for(J=0;J<=I;J++) { if(List[J]>List[I]) { Temp=List[I]; List[I]=List[J]; List[J]=Temp; } } } printf(“\nList Before Sorting :\n”); for(J=0;J<10;J++)… Read More »

## Write a program to sort a list of strings in alphabetical order, using an array of pointers. 10m Jun2006

Write a program to sort a list of strings in alphabetical order, using an array of pointers. 10m Jun2006 #include<stdio.h> void main() {     char *T;     int I,J,K;     char *ARRAY[5]={“SUNIL”,”ANIL”,”DILIP”,”JAY”,”BHARAT”};     clrscr();     for(I=0;I<5;I++)     {        printf(“%s \t”,ARRAY[I]);     }     printf(“\n”);     for(I=0;I<4;I++)     {       for(J=0;J<4-I;J++)       {  K=strcmp(ARRAY[J],ARRAY[J+1]);  if(K>0)… Read More »

## An Assembly program to sort a given set of 16-bit unsigned intergers into Ascending order

Now we will write another Assembly program to sort a given set of 16-bit unsigned intergers into Ascending order. Let’s identify variables needed for this program. First variables will be the one which will hold the values present in the Given Numbers in Array list and it will be array ARR. Other variables will be holding Length of… Read More »

## ASSEMBLY23 An Assembly program to sort a given set of 16-bit unsigned intergers into Descending order

Now we will write another Assembly program to sort a given set of 16-bit unsigned intergers into Descending order. Let’s identify variables needed for this program. First variables will be the one which will hold the values present in the Given Numbers in Array list and it will be array ARR. Other variables will be holding Length of… Read More »

## ASSEMBLY22 An Assembly program to sort a given set of 8-bit unsigned intergers into Ascending order

Now we will write another Assembly program to sort a given set of 8-bit unsigned intergers into Ascending order. Let’s identify variables needed for this program. First variables will be the one which will hold the values present in the Given Numbers in Array list and it will be array ARR. Other variables will be holding Length of… Read More »