Big O - Complexity Reference
Big O complexity reference of common data structures and sort algorithms.
Big O is an Android application that allows users to get access to a reference of run-time complexity about common data structures and sort algorithms. What’s more, the application also allows users to run speed tests to compare the run-time between these data structures and sort algorithms.
Big O is an Android application that allows users to get access to a reference of run-time complexity about common data structures and sort algorithms. What’s more, the application also allows users to run speed tests to compare the run-time between these data structures and sort algorithms.
Read trusted reviews from application customers
Very useful
Not impressed at all - should include code examples of every type of data structures and sorting methods for them. In C In In preferably, definitely not using readily available libraries, but actual code for implementing them. All this, with more sorting methods C AND code examples can be found by simple Web search.
Love it
It helped me a lot on my previous studies. Great app
Too few details about the algorithms. Also there are very less sorting methods and/or algorithms given.
It's gud but sometimes ans are nt sufficient enough
Loving it. So simple to understand.
Nice app, but Graph algorithms are missing unfortunately.
Smart. Reduced.
It's ok for learning.