Now let's move on and implement it in a C program. To sort an array in ascending order using selection sort technique in C programming, you have to ask from user to enter the array size and its elements.
Then apply the selection sort mechanism and print the sorted array as output just like the program given below:. As the above program was written under Code::Blocks IDE, therefore here is the sample run after successful build and run. This is the first snapshot of sample run:. Now supply size for array say 5 and its element as 54 21 8 18 3 and press ENTER key to see the sorted array as shown in the second snapshot of sample run given here:. It just makes the program longer. As our index starts from 0 and the value of n will start from 1 so using n-1 we are trying to comparile index 0 from index 1 initially and proceed further with the help of loop to compare the remaining.
Hope u got that. Your email address will not be published. One of the simplest techniques is a selection sort. It is also similar. We first check for smallest element in the array and swap it with the first element of the array. Again, we check for the smallest number in a subarray excluding the first element of the array as it is where it should be at the first position and put it in the second position of the array.
We continue repeating this process until the array gets sorted. The code is just an implementation of the above explanation.
Please login to view or add comment s. Become an Author Submit your Article. It's Simple and Conceptual. Get Python course for Days Hours Min Sec. Pro Course Features. Simple Videos.
0コメント