Array ( [0] => [1] => questions [2] => HackwithInfy-Previous-Questions [3] => Insertion-Sort )
Given a list of integers and a integer (size of array). Sort the given array using Insertion Sort Algorithm.
First line contains the size of array (n) followed by n integers separated by spaces.
Print the sorted array separated by spaces.
5 4 5 3 2 1
1 2 3 4 5
6 96 54 100 32 45 64
32 45 54 64 96 100
8 55 44 93 82 31
31 44 55 82 93
Login to see Discussion
Step-i) If it is the first element, it is already sorted. return 1;
Step-ii) Pick next element, Compare with all elements in the sorted sub-list.
Step-iii)Shift all the elements in the sorted sub-list that is greater than the value to be sorted. Insert the value/
Step-iv) Repeat until list is sorted.
Time Complexity: O(n^2)
Space Complexity: O(1)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution