Given a sorted array where the last element is not sorted, sort the array
Anónimo
#include void sortLastElement(int arr[], int n) { int last = arr[n-1]; int i = n-2; while (i >= 0 && arr[i] > last) { arr[i+1] = arr[i]; i--; } arr[i+1] = last; } void printArray(int arr[], int size) { for (int i = 0; i < size; i++) { printf("%d ", arr[i]); } printf("\n"); } int main() { int arr[] = {1, 2, 4, 5, 3}; int n = sizeof(arr)/sizeof(arr[0]); sortLastElement(arr, n); printf("Sorted array: \n"); printArray(arr, n); return 0; }