Create a table of Sorting Algorithms for use as a personal reference or to use if you were explaining algorithms to a peer or coworker.

Instructions:

Create a table of Sorting Algorithms: Binarry Tree, Heap, Hash tables, linked lists.

Down the left side of the table, list the four sorting algorithm names covered in Week 1.

In the next column (Description), give a brief description of the algorithm.

In the next column (Benefits), list some of the benefits of using the sorting method.

Note: You may also include pitfalls if you want to capture some of the downside of the method.

In the next column (Uses), list some organizational uses for the method.

When you are done, you should have a 1-page table.

Write a Narrative of the Table:

Write a one-half to 1-page narrative of the table (a narrative is simply a description of the table in writing) that could be used as a reference piece or for a teaching tool if you were explaining sorting algorithms to someone.

sorting algorithms

selection sort

bubble sort

merge sort

quick sort

heap sort pigeon hole sort