- // An insertion sort, which sorts moves in descending order up to and including a given limit.
- // The order of moves smaller than the limit is left unspecified.
- // To keep the implementation simple, *begin is always included in the list of sorted moves.
- void partial_insertion_sort(ExtMove* begin, ExtMove* end, int limit)
- {
- for (ExtMove *sortedEnd = begin + 1, *p = begin + 1; p < end; ++p)
+ // partial_insertion_sort() sorts moves in descending order up to and including
+ // a given limit. The order of moves smaller than the limit is left unspecified.
+ void partial_insertion_sort(ExtMove* begin, ExtMove* end, int limit) {
+
+ for (ExtMove *sortedEnd = begin, *p = begin + 1; p < end; ++p)