6. (10 points) Letters for you to use to fill in the blanks a (1) b (log n) c (n

Question

6. (10 points) Letters for you to use to fill in the blanks a (1) b (log n) c (n) d ( n log n) e (n2) f linear search g binary search For each statement below, fill in the blank with a letter chosen from the above list Correct responses may or may not be unique is O(log n) » The time to locate an integer in an array of size n using ·The time to locate an integer in an array of size 1.000.000.000.000.000 using binary search is . The time to append n items to an empty list with no tail reference is--. The time to append n items to an empty list with a tail reference is . The time to perform n extractMin) operations in a heap initially of size n is » The time to perform 100 extractMin) operations in a heap initially of size n 100 iS » The time to insert an integer at the beginning of a linked list of size n is The time to insert an integer at the beginning of an array list of size n is · If an exam contains n questions and it takes (1) time to grade each question. then grading the exam takes time o If you are given a pile of n exams sorted alphabetically by last name, then the time taken to find your exam takes time using

Explanation / Answer

1.Binary search.

2.theta(log n).

3.theta(n).

4.theta(1).

5.theta(n log n).

6.theta(1).

7.theta(1).

8.theta(n).

9.theta(n).

10..theta(log n),binary search.

Related Questions

Navigate

• Browse (All)
• Browse 6
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.