Search And Sorts
No description yet. This curated deck is ready for daily study.
Card preview (5)
What are 3 applications of the insertion sort
• Small data sets (good for small lists) • Extremely fast if items already in position • good for sorting new items into an already sorted list
Insertion sort implementation (or data structures)
• nested loops • arrays / lists • linked lists
What is the insertions sort
• the “one at a time” sort • idfk
What is the merge sort
A sorting algorithm that puts data in its correct place by “dividing” the data set
What are the core concepts of the merge sort
• Divide and conquer The program continues to split itself until it reaches two data pieces that are then sorted and put in there corresponding order • recursive The algorithm calls itself Whilst also having a terminating condition • sequential logic Solves sub problems individually and then combines them