The task is to complete the insert() function which is used to implement Insertion Sort.
Example 1:
Input: N = 5, arr[] = { 4, 1, 3, 9, 7}
Output: 1 3 4 7 9
Example 2:
Input: N = 10,
arr[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1}
Output: 1 2 3 4 5 6 7 8 9 10
Your Task: Since this is a functional problem you don't have to worry about input, you just have to complete the function insert(). The printing is done automatically by the driver code.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).
Constraints:
1 <= N <= 1000
1 <= arr[i] <= 1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| ppsvikhyat17 | 474 |
| saiujwal13083 | 357 |
| vt9941 | 355 |
| generic_coder | 318 |
| graj7418 | 306 |
| ppsvikhyat17 | 662 |
| saiujwal13083 | 616 |
| generic_coder | 550 |
| vt9941 | 479 |
| prakritish306 | 342 |
| blackshadows | 5448 |
| Ibrahim Nash | 5438 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4752 |