Algorithms Flashcards
1
Q
The complexity time for a bubble sort of n size
A
Is n(n-1)/2
2
Q
What order is the complexity time for a bubble sort
A
Quadratic order
3
Q
The constant k that unifies the actual execution time and the size of the list to be sorted can be
A
Changed based on they type of order the complexity time is. I.E. a quadratic order means that k will be squared
4
Q
What is the time complexity of a linear search at best?
A
O(1).
5
Q
O(1) describes which type of algorithm complexity?
A
O(1).
