Selection sort Mechanism and implementation
1 like714 views
The document explains the selection sort algorithm, detailing how to sort an array in ascending order by repeatedly finding the maximum element from the unsorted portion and swapping it with the first unsorted position. It provides a step-by-step explanation and includes a C implementation of the selection sort function, demonstrating the sorting of a specific dataset. The final output confirms that the array is sorted in ascending order.
![Implementation in C
#include <stdio.h>
void swap(int *a, int *b)
{ int temp = *a;
*a = *b;
*b = temp;
}
void Selection_Sort(int array[], int size_of_Array )
{
for (int step = 0; step < size_of_Array - 1; step++)
{
int max = step;
for (int i = step + 1; i < size_of_Array ; i++)
{
if (array[i] < array[min])
max = i;
}
swap(&array[max], &array[step]);
}
}
void display(int array[], int size_of_Array )
{
for (int i = 0; i < size_of_Array ; ++i)
{
printf("%d ", array[i]); } printf("n");
}
void main()
{
int data[] = {15, 10, 13, 14, 16, 12};
int size_of_Array = sizeof(data) / sizeof(data[0]);
Selection_Sort(data, size_of_Array );
printf("Sorted array in Acsending Order:n");
display(data, size_of_Array );
}](https://image.slidesharecdn.com/selectionsort-200429061523/85/Selection-sort-Mechanism-and-implementation-39-320.jpg)
Selection sort Mechanism and implementation
- 1. SELECTION SORT SOUMEN SANTRA MCA, M.Tech, SCJP, MCP
- 2. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 3. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 4. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 5. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 6. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 7. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 8. Selection Sort Ascending Order 15 10 13 14 16 12 Checking Largest one Data Comparing & Swapping Sorted
- 9. Selection Sort Ascending Order 15 10 13 14 16 12 Largest Checking Largest one Data Comparing & Swapping Sorted
- 10. Selection Sort Ascending Order 15 10 13 14 12 16 MOVING & SWAPPINGChecking Largest one Data Comparing & Swapping Sorted
- 11. Selection Sort Ascending Order 15 10 13 14 12 16 Checking Largest one Data Comparing & Swapping Sorted
- 12. Selection Sort Ascending Order 15 10 13 14 12 16 Checking Largest one Data Comparing & Swapping Sorted
- 13. Selection Sort Ascending Order 15 10 13 14 12 16 Checking Largest one Data Comparing & Swapping Sorted
- 14. Selection Sort Ascending Order 15 10 13 14 12 16 Checking Largest one Data Comparing & Swapping Sorted
- 15. Selection Sort Ascending Order 15 10 13 14 12 16 Checking Largest one Data Comparing & Swapping Sorted
- 16. Selection Sort Ascending Order 15 10 13 14 12 16 Checking Largest one Data Comparing & Swapping Sorted
- 17. Selection Sort Ascending Order 15 10 13 14 12 16 Largest Checking Largest one Data Comparing & Swapping Sorted
- 18. Selection Sort Ascending Order 12 10 13 14 15 16 MOVING & SWAPPINGChecking Largest one Data Comparing & Swapping Sorted
- 19. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 20. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 21. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 22. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 23. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 24. Selection Sort Ascending Order 12 10 13 14 15 16 Largest Checking Largest one Data Comparing & Swapping Sorted
- 25. Selection Sort Ascending Order 12 10 13 14 15 16 NO MOVING & NO SWAPPING POSITION FIX Checking Largest one Data Comparing & Swapping Sorted
- 26. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 27. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 28. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 29. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 30. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted Largest
- 31. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted NO MOVING & NO SWAPPING POSITION FIX
- 32. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 33. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 34. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted
- 35. Selection Sort Ascending Order 12 10 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted Largest
- 36. Selection Sort Ascending Order 10 12 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted COMPARING & SWAPPING
- 37. Selection Sort Ascending Order 10 12 13 14 15 16 Checking Largest one Data Comparing & Swapping Sorted ALL SORTED!
- 38. ALGORITHM Selection_Sort(Array, size of Array) Begin Do loop (size - 1) times set the first unsorted element as the maximum for each of the unsorted elements if element > current_Maximum set element as new maximum swap maximum with first unsorted position end
- 39. Implementation in C #include <stdio.h> void swap(int *a, int *b) { int temp = *a; *a = *b; *b = temp; } void Selection_Sort(int array[], int size_of_Array ) { for (int step = 0; step < size_of_Array - 1; step++) { int max = step; for (int i = step + 1; i < size_of_Array ; i++) { if (array[i] < array[min]) max = i; } swap(&array[max], &array[step]); } } void display(int array[], int size_of_Array ) { for (int i = 0; i < size_of_Array ; ++i) { printf("%d ", array[i]); } printf("n"); } void main() { int data[] = {15, 10, 13, 14, 16, 12}; int size_of_Array = sizeof(data) / sizeof(data[0]); Selection_Sort(data, size_of_Array ); printf("Sorted array in Acsending Order:n"); display(data, size_of_Array ); }