Karteikarten
Sorting algorithms
Karten in diesem Stapel (8)
- 1What is Bubble SortIs a sorting algorithm, sorts data in passes going from first to last element, Largest values bubbles towards the end using comparisons
- 2what is a pass in a bubble sortwhen the highest data value gets pushed to the top of array
- 3Advantages of Bubble sort- is a simple algorithm than can be easily implemented on a computer
-Doesn't use very much memory - 4Disadvantages of Bubble sort- Inefficient way to sort a list
-slow to sort large arrays of data - 5What is Merge sortis "Divide and conquer", splits the array into smaller list of similar size and then into their individual elements and then proceeds to merge them back together in order
- 6Advantages of Merge sort- is more efficient and quicker than Bubble sort
-it has a very consistent running time regardless of how ordered the elements in the array was - 7Disadvantages of Merge sort-slow at identifying an already sorted list, will still go through the splitting and merging process
- it uses more memory than bubble sort - 8What is insertion sort
Informationen
- Beschreibung
- GCSE Computing Karteikarten am Sorting algorithms, erstellt von Crawford _Studying am 20/11/2021.
- Erstellt von
- Crawford _Studying
- Aufrufe
- 0
- Bewertung