/// Our insertion sort implementation, works with pointers and iterators and is
/// guaranteed to be stable, as is needed.
template<typename T, typename K>
/// Our insertion sort implementation, works with pointers and iterators and is
/// guaranteed to be stable, as is needed.
template<typename T, typename K>
- T value;
- K cur, p, d;
-
- if (firstMove != lastMove)
- for (cur = firstMove + 1; cur != lastMove; cur++)
- {
- p = d = cur;
- value = *p--;
- if (*p < value)
- {
- do *d = *p;
- while (--d != firstMove && *--p < value);
- *d = value;
- }
- }
+ T tmp;
+ K p, q;
+
+ for (p = first + 1; p < last; p++)
+ {
+ tmp = *p;
+ for (q = p; q != first && *(q-1) < tmp; --q)
+ *q = *(q-1);
+ *q = tmp;
+ }