Summary: Algorithms
- This + 400k other summaries
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding
Read the summary and the most important questions on Algorithms
-
1 Algorithms
This is a preview. There are 17 more flashcards available for chapter 1
Show more cards here -
What is a Bubble sort?
A sorting algorithm that repeatedly passes through a list to be sorted, comparing and swapping items that are in the wrong order. -
What is a disadvantage of Bubble sorts?
- It takes a very long time -
What is a Bucket sort?
A sorting algorithm that separates data into different collections, called buckets, which are filled with data and then sorted. -
What is an advantage to Bucket sort?
- It is quicker than a bubble sort. Putting data into small buckets that can be sorted individually reduces the number of comparisons that need to be carried out. -
What is a disadvantage to Bucket sort?
- The algorithm is a bit more complicated than the bubble sort to describe for a computer. -
What is insertion sort?
Each item is taken in turn, compare to the items in a sorted list and placed in the correct position. -
What is Shell sort?
In-place comparison sort. It can be seen as either a generalization of sorting by exchange (bubble sort) or sorting by insertion sort. -
What is Merge sort?
It continually splits list in half and compares. -
What is Heap sort?
It organises data then sorts it into a binary tree. -
What is a Quick sort?
It utilises a divide and conquer strategy to quickly sort data.
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding