Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- main() {
- print(insertionSort([8,9, 4, 2, 6,10,12]));
- }
- List<int> insertionSort(List<int> list) {
- for (int j = 1; j < list.length; j++) {
- int key = list[j];
- int i = j - 1;
- while (i >= 0 && list[i] > key) {
- list[i + 1] = list[i];
- i = i - 1;
- list[i + 1] = key;
- }
- }
- return list;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement