Help Contact For teachers and institutes

Mock Tests Classes Groups

StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

Physics
Chemistry
Mathematics
Biology
Python Programming
Statistics & Data Science
Classes
Groups

Practice

Problems
Quizzes
Mock Tests
Question Sets
Exams
Certificates
Python Labs
AI Practice Generator
Student-Created Tests

Community

Discussions
Resources
Notes
Blog

Account

Dashboard
My Content
Profile
Log in

© 2026 senLearn. All rights reserved.Help About Contact Privacy Policy Terms of Use Refund Policy

A race: linear against binary | StemPy Lab

Python Labs
A race: linear against binary

Python ProgrammingMediumHigh School (9–10)High School (11–12)UndergraduateGeneralPython Essentials › Searching and Sorting

A race: linear against binary

The program searches for the last item in a sorted list in two ways and counts the checks.

Try this: change size = 1000 to 10, then to 100000. How do the two counts change?

Contributed by StemPy Lab

python

Loading Python runtime…

← A fair die?Five ways to sort words →

More onPython Essentials › Searching and Sorting

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

Binary searchFind It and Put It in Order

More labs on this topic

Project: a class rankingMedium
Count the workMedium
Sort the classMedium
Search a sorted listMedium
Search by handEasy

All labs on this topic →