CS173: Intro to Computer Science - Insertion Sort (3 pts)
Explorer
GitHub
Connect to GitHub to push and pull your project files to a repository.
On the page that opens, create a token with repo scope, copy it, then paste it below.
Paste the personal access token you created on GitHub with repo scope.
Click Refresh to load commit history
Exercise Info
Goals
To swap two variables in memory
To implement the insertion sort algorithm
Instructions
Please fill in the swap method to swap arr[i] with arr[j]. Below is some of the code we wrote in the video to setup random arrays, as well as skeleton code for insertion sort. The main method fills in a random array, prints that array, calls the insertionSort method, and then prints the result. Once this method works properly, your insertion sort code will properly sort the array.
If you just say arr[i] = arr[j], then that will do half of the swap, but now you’ve overwritten what arr[i] used to be, so you’ve lost the information you need to update arr[j]. Try creating a temporary variable to store the value in arr[i] before you overwite it with what’s in arr[j].