Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Find the minimum element in unsorted array and swap it with
- element at beginning.
- Time Complexity: O(N^2)
- */
- #include <stdio.h>
- void SelectionSort(int arr[],int n){
- int min;
- for(int i=0 ; i<n-1 ; i++){
- min=i;
- for(int j=i+1 ; j<n ; j++){
- if(arr[j]<arr[min]) {
- min = j;
- }
- }
- int temp = arr[i];
- arr[i] = arr[min];
- arr[min] = temp;
- }
- }
- int main()
- {
- int n;
- scanf("%d", &n);
- int arr[n];
- for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
- SelectionSort(arr,n);
- for(int i=0 ; i<n ; i++) printf("%d ",arr[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement