Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- void swap(int*a,int*b)
- {
- int temp;
- temp=*a;
- *a=*b;
- *b=temp;
- }
- void selectionSort(int arr[],int length)
- {
- int i,j;
- for(i=0;i<length-1;i++)
- {
- int minAtI = i;
- for(j=i+1;j<length;j++)
- if(arr[j]<arr[minAtI])
- minAtI=j;
- swap(&arr[minAtI],&arr[i]);
- }
- }
- void insertionSort(int arr[],int length)
- {
- int i,j;
- for(i=1;i<length;i++)
- for(j=i;j>0;j--)
- if(arr[j-1]>arr[j])
- swap(&arr[j-1],&arr[j]);
- else
- break;
- }
- void bubbleSort(int arr[],int length)
- {
- int i,j;
- for(i=length-1;i>0;i--)
- for(j=0;j<i;j++)
- if(arr[j]>arr[j+1])
- swap(&arr[j],&arr[j+1]);
- }
- int main ()
- {
- printf("Enter size of array: ");
- int n;
- scanf("%d",&n);
- int arr[n];
- size_t length = sizeof(arr) / sizeof(int);
- int i;
- for(i=0;i<length;i++)
- arr[i]=rand()%10;
- printf("Before sort: \n");
- for(i=0;i<length;i++)
- printf("%d ",arr[i]);
- printf("\n");
- //selectionSort(arr,length);
- //insertionSort(arr,length);
- //bubbleSort(arr,length);
- printf("After sort: \n");
- for(i=0;i<length;i++)
- printf("%d ",arr[i]);
- printf("\n");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement