Question

1. (10 pts) What is the order of each of the following tasks in the worst case (the worst case of the best algorithm for the task) (in Big-Oh notation)? • Searching a pointer-based link listed of n integers for a particular value. Answer: Searching a sorted array of n integers for a particular value. Answer: • Searching an unsorted array of n integers for a particular value. Answer: • Inserting a new value into a sorted array of n integers. Answer: Inserting n integers into an empty (ordinary) binary search tree. Answer: Inserting n integers into an empty AVL tree. Answer: • Inserting a new value into a heap of n integers. Answer: • Checking whether an array of n integers is a heap or not Answer: Sorting an array of n integers using key comparisons. Answer:

Answer 1

******************************************************************************************
Please Upvote the answer as it matters to me a lot :)
*****************************************************************************************
As per HomeworkLib expert answering guidelines,Experts are supposed to answer only certain number of questions/sub-parts in a post.Please raise the remaining as a new question as per HomeworkLib guidelines.
******************************************************************************************

1)
a)in worst case you might traverse through the entire list to find the particular value so O(n)
b) if you use binary search then you can search the element in worst case O(logn)
c)as the array is unsorted in worst case you might have to traverse the entire array so O(n)
d)O(n) as you have to move the elements to right while inserting , the no of elements to be moved can be n in worst case