Skip to content

Instantly share code, notes, and snippets.

@BMU-Verlag

BMU-Verlag/mergesort_1_1.c

Created July 8, 2020 15:41
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/715f74d0709453c0d654c1c693b6b2af to your computer and use it in GitHub Desktop.
Save BMU-Verlag/715f74d0709453c0d654c1c693b6b2af to your computer and use it in GitHub Desktop.
Download ZIP
Raw
mergesort_1_1.c
int arr[] = {15, 121, 8, 11, 1, 7, 19, 5};
int arr_groesse = sizeof(arr) / sizeof(arr[0]);
int arr2[arr_groesse];
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment