# c-array-sorting
/* © oMeN23 aka David Schuster in 2016-2017
 * program that shows new C programmers the easiest array sorting/array-member swapping mechanisms ...
 * free of charge - atleast please mention me
 * hope this helps anyone
 * contact: https://twitter.com/oMeN2351
 */ 
test-run:
a[0] = 26
a[1] = 9
a[2] = 88
a[3] = -2
a[4] = -5
a[5] = 12
a[6] = 55
a[7] = 99
a[8] = 12324
a[9] = 111
a[10] = 43
a[11] = 42
a[12] = 41
a[13] = 88
a[14] = 102
a[15] = 55
a[16] = 66
a[17] = 77
a[18] = 88
a[19] = 123
a[20] = 10000
a[21] = 103
a[22] = 105
calling merge_sort(...)
a[0] = -5
a[1] = -2
a[2] = 9
a[3] = 12
a[4] = 26
a[5] = 41
a[6] = 42
a[7] = 43
a[8] = 55
a[9] = 55
a[10] = 66
a[11] = 77
a[12] = 88
a[13] = 88
a[14] = 88
a[15] = 99
a[16] = 102
a[17] = 103
a[18] = 105
a[19] = 111
a[20] = 123
a[21] = 10000
a[22] = 12324

try and recompile with every algorithm, valgrind checked (=