HOMEWORK

  • Choose one sorting algorithm (Bubble, Selection, Insertion, or Quick Sort)

  • Create a small visualization or step-by-step explanation of how your chosen algorithm sorts the array: [42, 17, 29, 8, 35]

  • Calculate how many comparisons and swaps your algorithm needs to sort this array

  • What is the best case and worst case time complexity of your chosen algorithm?