#includevoid insertsort(int* arr,int length) { if(arr == NULL || length < 0) return; for(int i = 1; i < length; i++) { for(int j = i; j > 0; j--) { if(arr[j-1] > arr[j]) { int temp = arr[j-1]; arr[j-1] = arr[j]; arr[j] = temp; } } } } int main() { int arr[] = {42,1,12,4,44,32}; int nLength = sizeof(arr)/sizeof(arr[0]); insertsort(arr,nLength); for(int i = 0;i < nLength; i++) { printf(" %d ",arr[i]); } return 0; }



