1. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

2. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

3. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

4. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

5. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

6. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

7. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

8. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

9. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

10. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

11. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

12. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

13. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

14. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

15. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

16. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

17. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

18. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

19. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

20. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

21. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

22. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

23. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

24. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

25. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

26. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

27. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

28. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

29. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

30. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

31. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

32. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

33. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

34. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

35. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

36. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

37. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

38. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

39. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

40. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

41. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

42. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

43. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

44. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

45. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.

46. Insertion Sort Demo Sorting problem:
Given an array of N integers, rearrange them so that they are in increasing order.
Insertion sort
Brute-force sorting solution.
Move left-to-right through array.
Exchange next element with larger elements to its left, one-by-one.