Selection Sort - Ascending

#include<stdio.h>

#include<conio.h>

int small,temp,sort,n;

int a[100];

int b[100];

void asd()

{

for (int i=0;i<n-1;i++)

            {

                        small= i;

                        for (int j=sort;j<n;j++)

                        {

                        if (a[j] < a[small])

                        {

                                    small = j;

                        if (a[i] != a[small])

                        {

                                    temp = a[i];

                        if (a[i] > a[small])

                        {

                                    a[i] = a[small];

                                    a[small] = temp;

                        }

                        }

                        }

                        }

            sort = sort + 1;

            }          

}

void main()

{

           

            printf("==================================================================\n");

            printf("========================[ SELECTION SORT ]========================\n");

            printf("==================================================================\n");

            printf("Masukan banyak data : ");

            scanf("%i", &n);

            printf("\n");

            sort = 1;

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

                        {

           

            printf("Masukan data ke a[ %i ] : ", i + 1);scanf("%i", &a[i]);

            b[i] = a[i];

                        }          

            printf("\n");

            printf("==================================================================\n");

           

            asd();

            printf("Hasil Sorting...Ascending   ");

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

            {

            printf(" -> %i",a[i]);

            }

            printf("\n");

            printf("==================================================================\n");         

            printf("\n\n");

            getch();

}