sorting_algorithms_exercise

Sorting Algorithms Exercise

For this exercise you must get the tests to pass.

Part I

bubble sort

Implement bubble sort. Your function should accept an array and return an array of sorted values.

selection sort

Implement selection sort. Your function should accept an array and return an array of sorted values.

insertion sort

Implement insertion sort. Your function should accept an array and return an array of sorted values.

Part II

merge sort

Implement merge sort. Your function should accept an array and return an array of sorted values. You can solve this iteratively or recursively.

quick sort

Implement quick sort. Your function should accept an array and return an array of sorted values. You can solve this iteratively or recursively.