mirrors/coding-interview-university
mirrors
/
coding-interview-university
mirror of https://github.com/jwasham/coding-interview-university.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

translated kd trees

This commit is contained in:
Javid Askerov 2019-10-29 23:24:03 +04:00
parent cc0cdba384
commit 6f60da42d4
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
translations/README-ru.md
View File

@ -1786,11 +1786,11 @@ Google не возьмёт тебя на работу.
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
- ### k-D Trees
- great for finding number of points in a rectangle or higher dimension object
- a good fit for k-nearest neighbors
- [ ] [Kd Trees (video)](https://www.youtube.com/watch?v=W94M9D_yXKk)
- [ ] [kNN K-d tree algorithm (video)](https://www.youtube.com/watch?v=Y4ZgLlDfKDg)
- ### k-D Деревья
- прекрасны для нахождения всех точек в прямоугольнике или более многомерном объекте
- хорошо подходят для k-ближайших соседей
- [ ] [Kd Деревья (видео)](https://www.youtube.com/watch?v=W94M9D_yXKk)
- [ ] [kNN Алгоритм K-d дерева (видео)](https://www.youtube.com/watch?v=Y4ZgLlDfKDg)
- ### Skip lists
- "These are somewhat of a cult data structure" - Skiena