Document Type

Student Presentation

Presentation Date


Faculty Mentor

Sam Coskey


Internal sorting methods are possible when all of the items to be accessed fit in a computer's high-speed internal memory. There are quite a few (Knuth's third volume of The Art of Computer Programming covers 14 in total) but I will go over the four I found to be most versatile and useful. Each algorithm that I cover has a specific benefit that merits its' use in computer science. Some have faster run times (Heapsort), simpler code (Straight Insertion), run with a smaller memory space (Quicksort), or work well with large sets (Radix Sorting). Different sorting tasks lead users to unique sorting algorithms and so we have many variations of organization systems.

Included in

Mathematics Commons