Insertion Sort - Part 2

  • + 0 comments

    Do not let the sample explanation confuse you? You don't need any further inspection if the current value is greater than the one preceding. The solution to this problem is same as insertionsort1 except for printing and scope.