목록2022/02 (1)
Silver Library (Archived)
Types of algorithm
QuickSort https://www.geeksforgeeks.org/quick-sort/ Always pick first element as pivot. Always pick last element as pivot (implemented below) Pick a random element as pivot. Pick median as pivot. The order of its process should be done in linear time. This is divide and conquer algorithm. Merge Sort https://www.geeksforgeeks.org/merge-sort/ Like QuickSort, this is divide and conquer algorithm. h..
F2. Problem & Solving/Solving
2022. 2. 14. 09:30