Summary

Learning Team: Sort Priorities

Tasia Ellington

William McKown

DAT/305

December 24, 2018

There are many algorithms that are used as we sort through things like database, lists, or whatever we are creating. The difference between so many algorithms is that it can be used at different time. In this summary, I will explain at least three different sorts that I think is best and why it’s the best for my University’s library catalogs, lists, and database. The sort I will be using for the catalog will be merge sort. The sort I will be using for the list will be head sort. The final sort I will be using for my database will be quick sort. Each one of the sort will be explain in each paragraph below to get a better understand of the University library.

First, let’s start with the catalogs. For the library, there will be many different types of variety of catalogs issue from all different sponsors. With the merge sort, it will compare and sort linked list that will focus on how to merge together each different catalog to maintain their original element of arrays so that way it can be easy for students to sort out the difference between each catalog that we have available in the library.

Next, let’s start with the list. The list will be able to function through their smartphones or emails whichever they prefer. With the head sort, the students will be able to add or remove any single items that they want or don’t want from their list of choice. The head sort will be useful because it can process the begin before all the data is available. So, the students will have access to first hand picks before becoming available in the library.

Finally, the database. The database will be use for the library system to show who checks in, who checks out, and any important information given will be held on the library system database for future reference. With the quick sort, the cache will be good for references when used for arrays. For sorting database into order that way it is prioritize and maintain in the system for as long as needed.

In conclusion, there are far more algorithm that can be used versus the ones that I have used above. I choose the algorithm because they sort through links fast, the combination just merge together to describe each individual separate.