Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/mergesort_1_3.c

Created July 8, 2020 15:43
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save BMU-Verlag/bdb493bd914b2fde55145ff6cbc806a7 to your computer and use it in GitHub Desktop.
Save BMU-Verlag/bdb493bd914b2fde55145ff6cbc806a7 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
mergesort_1_3.c
int main()
{
int arr[] = {15, 121, 8, 11, 1, 7, 19, 5};
int arr_groesse = sizeof(arr) / sizeof(arr[0]);
int arr2[arr_groesse];
printf("Urspr\201ngliches Array:\n");
arrayAusgeben(arr, arr_groesse);
mergeSort(arr, arr2, 0, arr_groesse - 1);
printf("\nSortiertes Array \n");
arrayAusgeben(arr, arr_groesse);
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment