How can the following algorithm be described?
left = 0right = len(sortedLyst) - 1while left <= right: midpoint = (left + right) // 2 if target == sortedLyst[midpoint]: return midpoint elif target < sortedLyst[midpoint]: right = midpoint - 1 else: left = midpoint + 1return -1
A. binary search
B. bubble sort
C. sequential search
D. selection sort
Answer: A
You might also like to view...
Computer ____________________ is the process of collecting, analyzing, and preserving computer-related evidence.
Fill in the blank(s) with the appropriate word(s).
AC Case 3-1As a project for his technology design class, Miles was asked to put all the staff information into the school database. He is building a form to enter the name, email address, and schedule of each staff member. Miles wanted to merge several of the cells in the form. After selecting the first cell he wanted to merge, he will hold down the ____ key before selecting the other cells.
A. Alt B. Home C. Shift D. Tab
Describe the three way handshake process as used by CHAP.?
What will be an ideal response?
When multiple windows are open, just click an application's icon in the title bar to switch windows.
Answer the following statement true (T) or false (F)