Question

You are given a sorted list A of length n, and a target value that is known to be present in the list. Write a program (in Python, C, C++, or Java) that returns the index of the target value in A, using no more than 3√𝑛 comparisons with the target value made by your algorithm in the worst-case scenario. Explain why the total number of comparisons does not exceed this bound.

Name: you are given a sorted list a of length n and a target value that is known to be present in the list write a program in python c c or java that returns the index of the target value in a usi 74728
Uploaded: 2019-10-01T06:15:15-08:00
Duration: 1 min 36 s
Channel: Clarissa Noh
Description: you are given a sorted list a of length n and a target value that is known to be present in the list write a program in python c c or java that returns the index of the target value in a usi 74728

          You are given a sorted list A of length n, and a target value that is known to be present in the list. Write a program (in Python, C, C++, or Java) that returns the index of the target value in A, using no more than 3√𝑛 comparisons with the target value made by your algorithm in the worst-case scenario. Explain why the total number of comparisons does not exceed this bound.

Added by Debra P.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Clarissa Noh

10/01/2019

Step 1

We will locate the target in at most 3t comparisons by using a two-phase scan: - Phase 1 (block probing): Probe elements at positions t, 2t, 3t, ..., up to t^2 (i.e., up to t probes). Stop as soon as A[i*t] >= target or when i reaches t. - Phase 2 (block Show more…

Show all steps

Thanks for your feedback!

You are given a sorted list A of length n, and a target value that is known to be present in the list. Write a program (in Python, C, C++, or Java) that returns the index of the target value in A, using no more than 3√𝑛 comparisons with the target value made by your algorithm in the worst-case scenario. Explain why the total number of comparisons does not exceed this bound.