Sorts Exercise

In this exercise, you are given several sets of numbers and strings.

group1 = [22, 3, 23, 17, 9, 18, 14, 11, 5, 25, 15, 10, 6, 19, 21, 4, 2, 13, 7, 16, 24, 12, 20, 1, 8]
group2 = [32, 29, 28, 47, 50, 43, 40, 45, 37, 46, 27, 49, 35, 26, 34, 44, 48, 42, 33, 41, 38, 31, 30, 36, 39];
group3 = ['sadly','roast','Loopy','burger','gavel','lure','postpone','frontal','Gavel','lavender'];

Description

In sorts.js, define a function, bubbleSort() that implements the Bubble Sort sorting method. Define another function, quickSort(), that implements the Quick Sort sorting method. Each function should accept an array as its input and return a sorted array. Run each function on each provided group and log the results to the console.

Completing and submitting the assignment

• To begin, fork this repository.
• Create a new Cloud9 workspace from your new repository.
  • Alternatively, you may clone your new repository to your computer.
• Modify the files and commit changes to complete your solution.
• Run node test to verify that all tests pass.
• Push/sync the changes up to GitHub.
• Create a pull request on the original repository to turn in the assignment.

You are also welcome commit, push, and create a pull request before you’ve completed your solution. You can ask questions or request feedback there in your pull request. Just mention @barberboy in your comments to get my attention.

Go the Extra Mile!

Want to learn some more? Try these variations:

• Concatenate group1 and group2 and sort them. (Hint: Array methods are your friend)

• Modify your sort methods so they are case insensitive.

• Concatenate group1, group2, and group3, and sort them. Observe how the results differ. Was this what you expected? Consider why it sorts this way.

Use git branch (and git checkout) to work on the extra challenges on separate branches.

References

• Array documentation
• Bubble sort
• Quick sort
• string.toLowerCase() method
• Equality operators
• console.log