Linear, Linear searching for an item in a single dimension array, O(n), Accessing an item after a collision using a hashing algorithm in a hash table, Checking if an item is already in a queue, Polynomial, O(n2 ), bubble sort, insertion sort, Nested for loops usually create this time complexity, Logarithmic, O(log N), merge sort, Divide and conquer algorithm to find an item in an array, binary search, quick sort, Best time complexity for large data sets, Constant, O(1), Accessing the contents of a single element of an array Accessing the contents of a single element of an array Accessing the contents of a single element of an array , Pushing items onto a stack, Popping items from a stack, Accessing an item that is not a synonym using a hashing algorithm.

Big O notation

દ્વારા
પ્રિન્ટ
એમ્બેડ

લીડરબોર્ડ

દૃશ્યમાન શૈલી

વિકલ્પો

ટેમ્પલેટ બદલો

આપોઆપ સંગ્રહ થયેલ છે: ?