Youtube: youtube.com/@JavaIsHere
Linkedin: linkedin.com/in/javokhirakramjonov
Bored? @javohirakramblog
Contact: @javahere_admin
Post #208
263

Demak bugungi data-structure challenge ga start beramiz!
- ⚡ 2
- 👍 1
- 🔥 1
JA @javahereblogs
Showing posts older than #209 · Back to latest


NLogN emas deb, to’g’ri. Sortlash uchun NLogN. lekin bizdagi array ning hajmi 26 va bu array ni saralash uchun 26*log(26). Lekin, buni hisoblab ko’rsak 200 dan ham kam bu esa const time hisoblanadi. Unda nima uchun O(1) bo’lmadi deb o’ylayotgan bo’lsangiz tepadagi 2 ta so’zlarning uzunligi maximum 10ˆ5 ekanligi berilgan va biz ularni massiv shakliga keltirib to’liq yurib chiqdik bu esa O(N). Shunday qilib: O(N) + O(1) = O(N).



