Quicksort. Hash Tables, and Binary Search Trees

What is the time complexity of the following code? (Click on image to view full screen)

• O(nlogn)

• O(n)

• O(1)

Answer explanation

If one unit of time is used to represent run time, the above program can be run in n times the amount of time. As a result, the program scales linearly with the size of the input and has an order of O(n).

What is the Time Complexity of the attached code?(Click on image to view full screen)

• O(n)

• O(1)

• O(log n)

What is the time complexity of the following code?(Click on image to view full screen)

• O(1)

• O(n log n)

• O(n)

Answer explanation

This is a nested loop, so it has a cumulative time complexity

What is the time complexity of the code?(Click on image to view full screen)

• O(1)

• O(n)

• O(n log n)

• O(2)

What is the search complexity in direct addressing of hash tables?

• O(n)

• O(log n)

• O(n log n)

• O(1)

What is the average run time for quick sort algorithm?

• O(n)

• O(nlog n)

• O(log n)

How many sub arrays does the quick sort algorithm divide the entire array into?

• One

• Two

• Four

• Three

What is the worst case time complexity of the Quick sort?

• O(nlogn)

• O(n)

In Order Traversal

• 50 40 20 30 10

• 40 50 20 30 10

• 10 20 30 40 50

• 40 20 50 10 30

What is the worst case time complexity for search, insert and delete operations in a GENERAL Binary Search Tree?

• O(n) for all

• O(logn) for all

• O(logn) for search, insert and O(n) for delete

• O(logN)