Friday, 24 July 2015

#datastructure

The complexity of linear search algorithm is==== O(n)

The complexity of Binary search algorithm is====O(log n)

The complexity of Bubble sort algorithm is =======O(n2)

The complexity of merge sort algorithm is =====O(n log n)



                                                                                       #Surenders Tech World @surender singh

No comments:

Post a Comment