#include <stdio.h> int main() { int i, j, num, temp, arr[1500]; printf(“Enter number of elements\n”); scanf(“%d”, &num); printf(“Enter %d integers\n”, num); for (i = 0; i < num; i++) { scanf(“%d”, &arr[i]); } for (i = 1 ; i <= num – 1; i++) { j = i; while ( j > 0 && arr[j] < arr[j-1]) { temp = arr[j]; arr[j] = arr[j-1]; arr[j-1] = temp; j–; } } printf(“Insertion sorting in ascending order:\n”); for (i = 0; i <= num – 1; i++) { printf(“%d\n”, arr[i]); } return 0; }
Output:
Please enter the number of elements
4
Enter 4 numbers
2
1
8
Insertion sorting in ascending order:
total answers (1)
start bookmarking useful questions and collections and save it into your own study-lists, login now to start creating your own collections.
Output:
Please enter the number of elements
4
Enter 4 numbers
2
1
8
4
Insertion sorting in ascending order:
1
2
4
8
need an explanation for this answer? contact us directly to get an explanation for this answer