qsort in c
#include <stdlib.h>
int cmpfunc (const void * a, const void * b) {
return ( *(int*)a - *(int*)b );
}
int main () {
//n is number of elements in arr(size f that arr)
qsort(arr, n, sizeof(int), cmpfunc);
}qsort in c
#include <stdlib.h>
int cmpfunc (const void * a, const void * b) {
return ( *(int*)a - *(int*)b );
}
int main () {
//n is number of elements in arr(size f that arr)
qsort(arr, n, sizeof(int), cmpfunc);
}sorting program in c
#include<stdio.h>
int main(){
/* Here i & j for loop counters, temp for swapping,
* count for total number of elements, number[] to
* store the input numbers in array. You can increase
* or decrease the size of number array as per requirement
*/
int i, j, count, temp, number[25];
printf("How many numbers u are going to enter?: ");
scanf("%d",&count);
printf("Enter %d elements: ", count);
// Loop to get the elements stored in array
for(i=0;i<count;i++)
scanf("%d",&number[i]);
// Logic of selection sort algorithm
for(i=0;i<count;i++){
for(j=i+1;j<count;j++){
if(number[i]>number[j]){
temp=number[i];
number[i]=number[j];
number[j]=temp;
}
}
}
printf("Sorted elements: ");
for(i=0;i<count;i++)
printf(" %d",number[i]);
return 0;
}sorting in c
#include <stdio.h>
int main()
{
int ara[1000];
int high;
printf("How many numbers are you going to enter ? (max:1000) : ");
scanf("%d", &high);
int i, j, min;
printf("n");
for (i = 0; i < high; i++)
{
printf("Type number : ");
scanf("%d", &ara[i]);
}
printf("n The numbers arranged in ascending order are : n");
for (i = 0; i < high; i++)
{
for (j = i; j < high; j++)
{
if (ara[i] > ara[j])
{
min = ara[i];
ara[i] = ara[j];
ara[j] = min;
}
}
// The numbers arranged in ascending order are
printf("%dn", ara[i]);
}
return 0;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
