int main() { int n, i, j, key; printf("Enter the number of elements: "); scanf("%d", &n); int arr[n]; printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } for (i = 1; i < n; i++) { key = arr[i]; j = i - 1; while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = key; } printf("Sorted array: \n"); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } printf("\n"); return 0; } Input: Enter the number of elements: 5 Enter the elements: 64 25 12 22 11 Output: Sorted array: 11 12 22 25 64
3. iii) #include <stdio.h>
int main() { int n, i, j, temp; printf("Enter the number of elements: "); scanf("%d", &n); int arr[n]; printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } for (i = 0; i < n-1; i++) { for (j = 0; j < n-i-1; j++) { if (arr[j] > arr[j+1]) { // Swap arr[j] and arr[j+1] temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } printf("Sorted array: \n"); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } printf("\n"); return 0; } Input: Enter the number of elements: 5 Enter the elements: 6 5 1 2 8 Output: Sorted array: 1 2 5 6 8
