algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-27 20:22:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents: reorganize algorithms section

Browse Source
This commit is contained in:
Yangshun
2022-02-06 15:37:53 +08:00
parent 38d0038fd8
commit 42c21f9819
26 changed files with 191 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
contents/algorithms/sorting-searching.md
View File

@ -20,3 +20,9 @@ When a given sequence is in a sorted order (be it ascending or descending), usin
- Find the minimum element in a sorted rotated array in faster than O(n) time.
- Write a function that takes a number as input and outputs the biggest number with the same set of digits.
- [Source](http://blog.gainlo.co/index.php/2017/01/20/arrange-given-numbers-to-form-the-biggest-number-possible/)
## Recommended courses
import AlgorithmCourses from '../\_courses/AlgorithmCourses.md'
<AlgorithmCourses />