Rosetta Code

Sorting algorithms/Merge sort: Difference between revisions

← Older editNewer edit →
Content deleted Content added
No edit summary
CNHume (talk | contribs)
159 edits
Added insert() method to InsertionSort class.
Line 904:
static class InsertionSort<T> where T : IComparable {
public static void Sort(T[] entries, Int32 first, Int32 last) {
for (var iindex = first + 1; iindex <= last; iindex++) {
varinsert(entries, entryfirst, = entries[i]index);
var j = i;}
 
while (j > first && entries[j - 1].CompareTo(entry) > 0)▼
private static void insert(T[] entries, Int32 first, Int32 index) {
entries[j] = entries[--j];▼
var entry = entries[jindex] = entry;
▲ while (jindex > first && entries[jindex - 1].CompareTo(entry) > 0)
}
▲ entries[jindex] = entries[--jindex];
entries[index] = entry;
}
}
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Merge_sort"