Revision history of "C Language Practice: Sorting - Merge Sort"

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • curprev 11:52, 5 April 2022‎ Eric talk contribs‎ 6,102 bytes +6,102‎ Created page with "== Merge Sort == '''What is merge sort?''' Hooray! We have another way of sorting - merge sort! This type of sorting is pretty fast in my opinion. What we want to do in merge sort(there are also different ways people can understand this. This is only my opinion. You can search for other opinions if you like) is that we start by cutting the list. We cut the list in halves, then we cut the halves into halves, and we cut those halves into halves again and again until ther..."