Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 17

Write a C program that sorts the given array of integers using selection sort in descending order.


#include <stdio.h> 

void main()

{

int data[100],i,n,j,temp; 

clrscr();

printf("\n Enter the number of elements to be sorted:\n "); 

scanf("%d",&n);

for(i=0;i<n;++i)

{

 printf("\n %d. Enter element: ",i+1); 

 scanf("%d",&data[i]);

}

printf("\n The Entered Elements are:\n"); 

for(i=0;i<n;i++)

printf("%d\t",data[i]);


for(j=0;j<n;++j) 

for(i=j+1;i<n;++i)

{

if(data[j]<data[i]) //To sort in ascending order, change < to >

{

temp=data[j]; 

data[j]=data[i]; 

data[i]=temp;

}

}

printf("\n The Elements in descending order:\n"); 

for(i=0;i<n;++i)

printf("%d\t",data[i]); 

getch();

}

OUTPUT:

Enter the number of elements to be sorted:

 7

 1. Enter element: 43

 2. Enter element: 45

 13. Enter element: 6

 4. Enter element: 87

 5. Enter element: 49

 6. Enter element: 52

 7. Enter element: 3

 The Entered Elements are:

43 45 6 87 49 52 3

 The Elements in descending order:

87 52 49 45 43 6 3

Comments

Popular posts from this blog

EAMCET and ECET Web Options Guidance For Data Science, AI and Machine Learning.

EAMCET and ECET WEB OPTIONS GUIDANCE   Data Science, AI ,Machine Learning and CSE:  These NEW courses are trending now and according to the research these courses are having  tremendous  future in coming days. All these branches are sub branches of CSE and now it became separate Technologies. For video explanation click on  click here                Branch Name                                                                      Branch code 1. CSE(Artificial Intelligence and Machine Learning)                                            CSM 2. CSE...

INSERTION SORT, BUBBLE SORT, SELECTION SORT

// C program for insertion sort #include <math.h> #include <stdio.h> void insertionSort(int arr[], int n);     // A utility function to print a sorted array of size n void printArray(int arr[], int n) {     int i;     for (i = 0; i < n; i++)         printf("%d ", arr[i]);     printf("\n"); }    // Driver code int main() {     int arr[15],n,i;         printf("enter number of elements in array \n");     scanf("%d", &n);         printf("enter array values to sort\n");     for(i=0; i<n; i++)     scanf("%d", &arr[i]);         insertionSort(arr, n);     printArray(arr, n);        return 0; } /* Function to sort an array using insertion sort*/ void insertionSort(int arr[], int n) {     int i, key, j;     for (i = 1; i < n; i++) ...