INU Login Sign up
Login Or Sign up

Answers for "c sort array in ascending order"

Whatever
1

arrange numbrs in ascending order in c

#include <stdio.h>
#include <conio.h>
void main ()
{
    int a[100];
    int temp,n,i,j;
    printf("How many numbers do you want to enter? : ");
    scanf("%d",&n);
    for (i=0;i<n;i++)
    {
        printf("Enter %d number: ",i+1);
        scanf("%d",&a[i]);
    }

    printf("nn.....arranging in ascending order.....nn");

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

        for (j = i + 1; j < n; ++j)
        {
            if (a[i] > a[j])

            {
                temp =  a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }

    for (i=0;i<n;i++)
    {
        printf("%d ",a[i]);
    }
}
Posted by: Guest on June-24-2021
6

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;
}
Posted by: Guest on October-08-2020
0

c program to find sot array in ascending order

// C program to sort the array in an
// ascending order using selection sort
 
#include <stdio.h>
#include<conio.h>
void swap(int* xp, int* yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}
 
// Function to perform Selection Sort
void selectionSort(int arr[], int n)
{
    int i, j, min_idx;
 
    // One by one move boundary of unsorted subarray
    for (i = 0; i < n - 1; i++) {
 
        // Find the minimum element in unsorted array
        min_idx = i;
        for (j = i + 1; j < n; j++)
            if (arr[j] < arr[min_idx])
                min_idx = j;
 
        // Swap the found minimum element
        // with the first element
        swap(&arr[min_idx], &arr[i]);
    }
}
 
// Function to print an array
void printArray(int arr[], int size)
{
    int i;
    for (i = 0; i < size; i++)
        printf("%d ", arr[i]);
    printf("n");
}
void main()
{
    int arr[] = { 0, 23, 14, 12, 9 };
    int n = sizeof(arr) / sizeof(arr[0]);
    printf("Original array: n");
    printArray(arr, n);
 
    selectionSort(arr, n);
    printf("nSorted array in Ascending order: n");
    printArray(arr, n);
 
    getch();
}
Posted by: Guest on September-26-2021

Code answers related to "c sort array in ascending order"

Code answers related to "Whatever"

Browse Popular Code Answers by Language

Python
Javascript
Whatever
Shell/Bash
CSS
Html
PHP
SQL
Java
C#

Popular Programming Languages

Abap ActionScript Assembly BASIC C C# C++ Clojure Cobol CSS Dart Delphi Elixir Erlang F# Fortran Go Groovy Haskell Html Java Javascript Julia Kotlin Lisp Lua Matlab Objective-C Pascal Perl PHP Prolog Python R Ruby Rust Scala Scheme Shell/Bash SQL Swift TypeScript VBA Whatever

Advertisements

290x500

Company

Compilers

Help

Connect with us

footer logo

Copyright © 2021 Codeinu