Selection Sort

Selection Sort

    Selection sort algorithm sorts an array by reapetly finding  the minimum element (considering ascending order) from unsorted port and putting it at the beginning.

Complexity of Selection Sort:

• Time Complexity

1. Best Case: O(n2)
2. Worst Case: O(n2)

• Space Complexity

1. Worst Case: O(1)

• Advantages of Selection Sort

1. Selction sort algorithm easy to implement.
2. No additional data-structure is required.
3. It is in-place sorting method & stable method.
4. The number of swap reduced.O(n) swap  in all cases.

• Disadvantages of Selction Sort

1. Best & Worst case efficiency is O(n2).

CODE

👇

1. #include <stdio.h>
2. int comp_cnt=0;
3. int main()
4. {
5. int a[20], n , i;
6. printf("\t>>Selection Sort<<\n");
7. printf("How many numbers you want in array ?\t");
8. scanf("%d",&n);
9. printf("\nEnter %d element:",n);
10. accept(a,n);
11. selection_sort(a,n);
12. printf("\t>>Sorted Array<<\n");
13. display(a,n);
14. printf("\nTotal number of comparisons = %d", comp_cnt);
15. return 0;
16. }
17. 
    
18. void accept(int a[], int n)
19. {
20. int i;
21. for(i=0; i<n; i++)
22. scanf("%d", &a[i]);
23. }
24. 
    
25. void display(int a[], int n)
26. {
27. int i;
28. for(i=0; i<n; i++)
29. printf("%d\t",a[i]);
30. }
31. 
    
32. void selection_sort(int a[], int n)
33. {
34. int i, temp, current, pos, smallest;
35. for(current=0; current<n-1; current++)
36. {
37. smallest = a[current];
38. pos = current;
39. for(i=current+1; i<=n-1; i++, comp_cnt++)
40. if(a[i] < smallest)
41. {
42. smallest = a[i];
43. pos = i;
44. }
45. temp = a[current];
46. a[current] = a[pos];
47. a[pos] = temp;
48. }
49. }

👉Execute👈

//Output

/*

>>Selection Sort<<

How many numbers you want in array ? 5

Enter 5 element:47

78

26

64

29

>>Sorted Array<<

26 29 47 64 78

Total number of comparisons = 10

*/

                                                                                            //ThE ProFessoR