Karteikarten
DSA - Lecture 4b
Karten in diesem Stapel (9)
- 1Give PseudoCode for a standard divide and conquer algorithmk
- 2How does insertionSort work?Split the list in two after which you sort one and one by one insert the elements of the other
- 3How does mergeSort work?Split list in half, sort each and merge them
- 4Learn to do a mergeSort on paperk
- 5How does selectionSort work?Split the list by putting the smallest one int list1 rest in list 2, selectionSort list 2, append the element in L1 to L2
- 6How does QuickSort work?split list in two with everything i L1 smaller than in L1. sort lists and append L2 to L1
- 7Give the 5 sorts and their complexities
- 8There are 2 more often used sorting algorithms which do not use the divide and conquer strategy. Which are these?Bubble Sort and Shell Sort
- 9Draw and explain Bucket Sortk
Informationen
- Beschreibung
- Karteikarten am DSA - Lecture 4b, erstellt von Lucas Vanparijs am 21/03/2015.
- Erstellt von
- Lucas Vanparijs
- Aufrufe
- 1
- Bewertung