low = 0 high = len(list) = n mid = (low + high)//2 If high = 0, return None Else if low < high (Hint: Use this comparison as base case) a. Compare sNum and middle element = list[mid] b. If sNum is equal/matches middle element, return mid + 1 (add 1 since index starts at 0) c. Else if x is greater than the middle element, then x can only lie in the right (greater) half sublist after the middle element i. low = mid +1 ii. mid = (low + high)//2 d. Else if x is less than the middle element, then x can only lie in the left (lesser) half sublist after the middle element i. high = mid – 1 ii. mid e. Go back to step 9 using new values for low, high, and mid Else, return None wwww w %3D (low + high)//2 Print “Element", x, “found:", and value returned (can save as a variable if use loop) if it is not None; if it is None, print “Not Found!"

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Can the picture below be added to the following code.

 
import random
n=int(input("Enter the number of elements that will be in the list:"))
sNum=int(input("Enter number you want to search:"))
randomlist = []
for i in range(n):
    n = random.randint(1,50)   # we had choose number between 1 to 50 
    randomlist.append(n) #you can choose your own
#print(randomlist)
for i in range(len(randomlist)):
        if(randomlist[i]==sNum):
            print(i)
print("Number not found")

 

low = 0
high = len(list) = n
mid = (low + high)//2
If high = 0, return None
Else if low < high (Hint: Use this comparison as base case)
a. Compare sNum and middle element = list[mid]
b. If sNum is equal/matches middle element, return mid + 1 (add 1 since index starts
at 0)
c. Else if x is greater than the middle element, then x can only lie in the right
(greater) half sublist after the middle element
i. low = mid + 1
ii. mid = (low + high)//2
d. Else if x is less than the middle element, then x can only lie in the left (lesser) half
sublist after the middle element
i. high = mid – 1
ii. mid = (low + high)//2
-
e. Go back to step 9 using new values for low, high, and mid
Else, return None
Print "Element", x, “found:", and value returned (can save as a variable if use loop) if it is
not None; if it is None, print “Not Found!"
Transcribed Image Text:low = 0 high = len(list) = n mid = (low + high)//2 If high = 0, return None Else if low < high (Hint: Use this comparison as base case) a. Compare sNum and middle element = list[mid] b. If sNum is equal/matches middle element, return mid + 1 (add 1 since index starts at 0) c. Else if x is greater than the middle element, then x can only lie in the right (greater) half sublist after the middle element i. low = mid + 1 ii. mid = (low + high)//2 d. Else if x is less than the middle element, then x can only lie in the left (lesser) half sublist after the middle element i. high = mid – 1 ii. mid = (low + high)//2 - e. Go back to step 9 using new values for low, high, and mid Else, return None Print "Element", x, “found:", and value returned (can save as a variable if use loop) if it is not None; if it is None, print “Not Found!"
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Mergesort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education