Introduction to Programming using Python 1st Edition

Published by Pearson
ISBN 10: 0132747189
ISBN 13: 978-0-13274-718-9

Chapter 10 - Lists - Section 10.11 - Sorting Lists - Check Point - MyProgrammingLab - Page 343: 10.21

Answer

The key should be inserted at index 3.

Work Step by Step

As per the convention mentioned in the book, when an element is not present in the list the binary search function will return a -ve number absolute having value of index+1. So the value -4 indicates that the element is not present in the list and it should be inserted at index 3.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.