DATA STRUCTURE--IMPLEMENTATION OF SORTING -->MAKE ASCENDING ORDER IN SAME ARRAY..

/*AN IMPLEMENTATION OF SORTING OF AN ARRAY ..AND CHANGE POSITION OF ITS ELEMENTS TO TRANSFORM IT INTO ASCENDING ORDER ARRAY  */

#include<stdio.h>

void display(int*);

void swap(int*,int);

int main()

{       int flag,i,j;

        int arr[10]={6,3,4,7,9,8,2,1,5,12};//this array is to be converted into ascending order

        for(j=0;j<9;j++)//loop inside loop shows that ...each & every element is to be chechked 9 times ..means no. of elements count....

        {

                for(i=0;i<9;i++)//0 to 9 value of j presenting elements of that array..which is to be trans formed..

//1st 9 times of loop of i will place most big element in array at last position

////2nd 9 times of loop of i will place 2nd most big element into 2nd last position     

////3rd 9 times of loop of i will place 3rd most big element into 3rd last position     

////4th 9 times of loop of i will place 4th most big element into 4th last position     

////5th 9 times of loop of i will place 5th most big element into 5th last position .....so on  

        {

                        flag=0;

                        if(arr[i]>arr[i+1])//chack if arr[0]>arr[1] ||arr[1]>arr[2] ||arr[2]>arr[3] ||arr[3]>arr[4]so on..

                        {

                                swap(arr,i);//swap if element at lower postion is greater than element at upper position

                        }

                        else

  {

                                flag++;

                                if(flag>5)//OPTIONAL

                                        break;

                        }

                }

        }

        display(arr);

        return 0;

}

void swap(int* arr,int i)

{

        int temp;

        temp=arr[i];//place lower pos. element into temp

        arr[i]=arr[i+1];//make upper pos element to lower pos. element

        arr[i+1]=temp;//place temp which has lower pos. element into upper pos...& make it upper pos. element...

//this is how shifting takes place every time

}

void display(int* arr)

{       int k;

        for(k=0;k<10;k++)

    {

                printf("\narr[%d]=%d",k,arr[k]);//after shiftiing of all the elements in loop...display sorted array in ascending order

        }

}