
If we talk about some sorting algorithms we'll see their running time is in the order of \(O(n log(n))\) time. In this article we'll talk why logarithm time is useful and how it's working? Let's imagine the following task for i in range(10): prin...
Computer Scientist
I go by theroyakash on the internet. I am a computer scientist, with research in high performance algorithms, data structures, distributed systems, and beyond. See my work searching google for theroyakash.
Markdown supported · ⌘↵ to post
No responses yet.