Write a Python program named "YourLibrary Searching.py" that starts by initializing a list of 25 strings representing book titles. Here are some sample titles: "The Catcher in the Rye", "To Kill a Mockingbird", "1984", "Pride and Prejudice", "The Great Gatsby", "One Hundred Years of Solitude", "Brave New World", "The Lord of the Rings", "The Hunger Games", "The Da Vinci Code", "The Alchemist", "Moby-Dick", "Frankenstein", "Jane Eyre", "Wuthering Heights", "The Odyssey", "The Count of Monte Cristo", "The Shining", "The Hobbit", "The Color Purple", "The Hitchhiker's Guide to the Galaxy", "Dune", "The Grapes of Wrath", "Slaughterhouse-Five". (a) Prompt the user for a target book title and pass the value, the list of titles, and the size of the list to a function that implements the linear or sequential search algorithm. This function should count the number of comparisons until it finds the title and return the count to the main function. (b) Call a function that uses the insertion sort algorithm to sort the given list of book titles. (c) Call a function that uses the binary search algorithm to locate the same target book title. Pass the value, the sorted list, and the size of the list to this function. The function should keep track of the number of comparisons and return this count to the main function. Display the number of comparisons for both search functions in the main with appropriate messages.

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
Don't try to use the AI platform or copy anything. If I see plagiarism I'll give you multiple downvotes this is for sure..
Write a Python program named "YourLibrary Searching.py" that starts by initializing a
list of 25 strings representing book titles. Here are some sample titles: "The Catcher in
the Rye", "To Kill a Mockingbird", "1984", "Pride and Prejudice", "The Great Gatsby",
"One Hundred Years of Solitude", "Brave New World", "The Lord of the Rings", "The
Hunger Games", "The Da Vinci Code", "The Alchemist", "Moby-Dick", "Frankenstein",
"Jane Eyre", "Wuthering Heights", "The Odyssey", "The Count of Monte Cristo", "The
Shining", "The Hobbit", "The Color Purple", "The Hitchhiker's Guide to the Galaxy",
"Dune", "The Grapes of Wrath", "Slaughterhouse-Five".
(a) Prompt the user for a target book title and pass the value, the list of titles, and the
size of the list to a function that implements the linear or sequential search algorithm.
This function should count the number of comparisons until it finds the title and
return the count to the main function.
(b) Call a function that uses the insertion sort algorithm to sort the given list of book
titles.
(c) Call a function that uses the binary search algorithm to locate the same target
book title. Pass the value, the sorted list, and the size of the list to this function. The
function should keep track of the number of comparisons and return this count to the
main function. Display the number of comparisons for both search functions in the
main with appropriate messages.
Transcribed Image Text:Write a Python program named "YourLibrary Searching.py" that starts by initializing a list of 25 strings representing book titles. Here are some sample titles: "The Catcher in the Rye", "To Kill a Mockingbird", "1984", "Pride and Prejudice", "The Great Gatsby", "One Hundred Years of Solitude", "Brave New World", "The Lord of the Rings", "The Hunger Games", "The Da Vinci Code", "The Alchemist", "Moby-Dick", "Frankenstein", "Jane Eyre", "Wuthering Heights", "The Odyssey", "The Count of Monte Cristo", "The Shining", "The Hobbit", "The Color Purple", "The Hitchhiker's Guide to the Galaxy", "Dune", "The Grapes of Wrath", "Slaughterhouse-Five". (a) Prompt the user for a target book title and pass the value, the list of titles, and the size of the list to a function that implements the linear or sequential search algorithm. This function should count the number of comparisons until it finds the title and return the count to the main function. (b) Call a function that uses the insertion sort algorithm to sort the given list of book titles. (c) Call a function that uses the binary search algorithm to locate the same target book title. Pass the value, the sorted list, and the size of the list to this function. The function should keep track of the number of comparisons and return this count to the main function. Display the number of comparisons for both search functions in the main with appropriate messages.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Random Class and its operations
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