Insertion Sort: [42, 17, 29, 8, 35]

[42, 17, 29, 8, 35] initial array, compare 42 and 17
[42, 42, 29, 8, 35] slide 42 to the right
[17, 42, 29, 8, 35] insert 17 to the left of 42, compare 42 with 29
[17, 42, 42, 8, 35] slide 42 to the right, compare 17 with 29
[17, 29, 42, 8, 35] insert 29 to the left of 42, compare 42 with 8
[17, 29, 42, 42, 35] slide 42 to the right, compare 29 with 8
[17, 29, 29, 42, 35] slide 29 to the right, compare 17 with 8
[17, 17, 29, 42, 35] slide 17 to the right
[8, 17, 29, 42, 35] insert 8 to the left of 17, compare 42 with 35
[8, 17, 29, 42, 42] slide 42 to the right, compare 29 with 35
[8, 17, 29, 35, 42] insert 35 to the left of 42, final array

8 comparisons, 4 insertions

best case time complexity of insertion sort: O(n)
worst case time complexity of insertion sort: O(n^2)