quick sort
Предварительный просмотр (5 стр.)
Прокрутите вниз 👇
1 / 25
![quick sort quick sort algorithms and data structures course 1 quick sort idea algorithms and data structures course 2 27 38 12 39 27 16 pivot choose first element as pivot notice anything special about the position of pivot in the final sorted items? 39 27 38 12 16 27 12 16 27 27 38 39 pivot pivot partition arr about the pivot 27 recursively sort the two parts quick sort divide step example algorithms and data structures course 3 p = p: if a[k]=y >= p: increment k: p < p x ≥ p y ? p < p x ≥ p y ? i m k j i m k j s1 s2 s1 s2 quick sort partition algorithm algorithms and data structures course 6 case 2: if a[k] < p if a[k]=y < p: p < p x ≥ p y ? i m k j s1 …](/media/previews/pages/preview_w5T353J.webp "quick sort - Страница 1")
2 / 25
![ms and data structures course 16 27 12 38 39 27 16 pivot s2 s1 unknown quick sort partition example algorithms and data structures course 17 27 12 16 39 27 38 pivot s2 s1 quick sort partition example algorithms and data structures course 18 16 12 27 39 27 38 pivot s2 s1 quick sort partition example algorithms and data structures course 19 quick sort implementation algorithms and data structures course 20 quick sort partition implementation algorithms and data structures course 21 quick sort partition analysis algorithms and data structures course 22 when the array is already in ascending order s1 is empty, while s2 contains every item except the pivot 5 18 23 39 44 57 p = a[i] s1 = a[i+1...m] empty when m = i s2 = a[m+1...j] quick sort worst case analysis algorithms and data structures course 23 n 1 n-1 n-2 1 1 1 …](/media/previews/pages/preview_4yVs01U.webp "quick sort - Страница 2")
3 / 25
4 / 25
5 / 25
О "quick sort"
quick sort quick sort algorithms and data structures course 1 quick sort idea algorithms and data structures course 2 27 38 12 39 27 16 pivot choose first element as pivot notice anything special about the position of pivot in the final sorted items? 39 27 38 12 16 27 12 16 27 27 38 39 pivot pivot partition arr about the pivot 27 recursively sort the two parts quick sort divide step example algorithms and data structures course 3 p = p: if a[k]=y >= p: increment k: p < p x ≥ p y ? p < p x ≥ p y ? i m k j i m k j s1 s2 s1 s2 quick sort partition …
Этот файл содержит 25 стр. в формате PPTX (434,3 КБ). Чтобы скачать "quick sort", нажмите кнопку Telegram слева.
