Answered: A sequential search of a sorted list…

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

See similar textbooks

Related questions

Question

A sequential search of a sorted list can halt when the target is less than a given element in the list.

Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary.

-----------------------------------------------------------------------------------

"""

File: search.py

Project 11.1

"""

def sequentialSearch(target, lyst):

"""Returns the position of the target item if found,

or -1 otherwise.

The lyst is assumed to be sorted in ascending order."""

position = 0

while position < len(lyst):

if target == lyst[position]:

return position

position += 1

return -1

def main():

"""Tests with three lists."""

print(sequentialSearch(3, [0, 1, 2, 3, 4]))

print(sequentialSearch(3, [0, 1, 2]))

# Should stop at second position.

print(sequentialSearch(3, [0, 4, 5, 6]))

if __name__ == "__main__":

main()

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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