Question:
An algorithm that doubles with each addition to the data set in each pass. Inefficient and should be avoided - O(2^n)
Author: SozenAnswer:
What is exponential complexity and what is the notation? (Big O)
0 / 5 Â (0 ratings)
1 answer(s) in total
Author
Sozen