[algorithms] ch2. Divide-and-Conquer algorithms (medians, quick sort)
Computer Science/algorithms
2023. 3. 11. 00:52
(23.03.10) algorithms S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani (2008) 책 읽고 정리하기 http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf 정리한 내용 2.4 medians (+ quick sort) Medians quick sort quick sort python code def quick_sort(input, start, end): if start >= end: return input pivot = start left = start+1 right = end while left right: input[right], input[pivot] = inpu..