sorting and efficiency is a very important topic when talking about computer science. From the beginning of this course, we have been learning various kinds of data structures (stacks, lists, dictionaries, etc.). One thing that is crucial to any data structure is sorting the data that is contained within.
There are many different ways to approach the problem of sorting. There are many different algorithms that can be used. Each one is unique in terms of how it sorts through the data and how efficiently it does such task.
Let's go into some detail for each of the sorting algorithms we have been introduced to thus far:
The Bubble Sort:
The Selection Sort:
The Insertion Sort:
The Shell Sort:
The Merge Sort:
The Quick Sort:
The Tim Sort (Built-in Sort):
a great resource to see most of these algorithms in action is: http://www.sorting-algorithms.com/
Quote of The Week:"One of my most productive days was throwing away 1,000 lines of code." - Ken Thompson
Weekly Glossary (Terms)
No comments:
Post a Comment