Big O - Complexity Reference
by Hieu T Nguyen
🗂️ Education
Version 1.0
đź“… Updated March 31, 2016
Big O complexity reference of common data structures and sort algorithms.
Features Big O - Complexity Reference
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.
Lightning Fast
Experience blazing fast performance with our optimized Android application.
See the Big O - Complexity Reference in Action
What Our Users Say
Don't just take our word for it. Here's what our users have to say about our Android app.
"Very useful"
Ritesh Kumar
"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."
Jani Saksa
"Love it"
Imdadul Haque
"It helped me a lot on my previous studies. Great app"
Lameck Yonah Junior
"Too few details about the algorithms. Also there are very less sorting methods and/or algorithms given."
Varun Chhangani
"It's gud but sometimes ans are nt sufficient enough"
Sagnik Roy789
"Loving it. So simple to understand."
A Google user
"Nice app, but Graph algorithms are missing unfortunately."
Alexander Häckler
"Smart. Reduced."
Max Herrmann
"It's ok for learning."
Andrei Tosea
Get the App Today
Available for Android 8.0 and above