4 AnswersNew Answer
Jayakrishna🇮🇳 Can you tell be how Insertion sort is different from Selection sort?
Hope these helps... https://www.sololearn.com/learn/658/?ref=app https://www.sololearn.com/learn/652/?ref=app
C++ already has sort methods and templates. It's usually only necessary to provide a function that performs the comparison operation. Here is an example of sorting a list of objects using the list::sort() method. https://code.sololearn.com/cA13a0a11a12/#cpp See: https://www.cplusplus.com/reference/algorithm/sort/ https://www.cplusplus.com/reference/list/list/sort/ Normally we sort in ascending order and simply iterate over the container in reverse to get the descending order or use a reverse() method.
Atul Once go through the link, you can understand it.. Selection Sort is first finds the smallest element in the array and swaps it with the element in the first 0th position, then finds the second and swaps it with second (1st) position, and continues for entire array.. Where as insertion sort, first arrange 1st 2 elements in order. Then next 3rd element is added in ascending order with 1,2. Now 1,2,3 are in ordered. Next 4th element is placed in order with 1,2,3,4 to its needed position.. so 1,2,3,4 is ordered now. This goes on for entire list. hope it helps..