Deliver a checked algorithm comparison
See this course’s project requirements
A tested Python catalog search with linear and binary methods, comparison counts, sortedness checks and a justified method choice.
Keep your working files in your own notebook or software. Save a private description, checklist, and work link in My Proof.
What to include
- A three-case lookup contract with results 5,-1,-1.
- A linear-search trace with six and seven comparisons.
- A sortedness rule and two-step interval trace.
- A terminating binary-search implementation and boundary trace.
- A cost comparison distinguishing lookup from total work.
- A checked algorithm-comparison packet with honest measurement limits.
Review and revise
Use these criteria to check your work and choose what to improve.
- The implementation or declared simulation follows the supplied contract and retains inspectable original inputs.
- Normal, boundary and rejected cases are recorded with expected versus observed results.
- The changed case has a correct explanation and does not rely on hidden state.
- The project includes source, outputs, instructions and honest tool, privacy and verification limits.
Want more background?
The idea in everyday life
Baseline tests include present 52, absent 30, empty input, one value and unsorted rejection. Add target 67 and a duplicate example.
A handoff ties each result to its input, preconditions and measured operation. Do not present a seven-record demonstration as a universal speed benchmark.
Deliver a checked algorithm comparison — original worked practice
A handoff ties each result to its input, preconditions and measured operation. Do not present a seven-record demonstration as a universal speed benchmark.
Baseline tests include present 52, absent 30, empty input, one value and unsorted rejection. Add target 67 and a duplicate example.
1. Step 1
Run python algorithms.py from the practice folder.
You should see: The provided five checks print a passed message.
This keeps the rule and its observable result together.
2. Step 2
Add linear and binary checks for 67.
You should see: Both return 6.
This keeps the rule and its observable result together.
3. Step 3
Record a duplicate case using the any-match rule.
You should see: An accepted matching index, without requiring first occurrence.
This keeps the rule and its observable result together.
4. Step 4
Package source, expected table, results and method choice.
You should see: A checked algorithm-comparison packet with honest measurement limits.
This keeps the rule and its observable result together.
What to finish
A checked algorithm-comparison packet with honest measurement limits.
Watch for this
Reporting a predicted count as measured execution or concealing a rejected unsorted case.
How can I tell I understand it?
Explain and demonstrate the required distinction: A handoff ties each result to its input, preconditions and measured operation. Do not present a seven-record demonstration as a universal speed benchmark. Show a changed input and the expected result without weakening this contract.
Quick knowledge check
Answer all 3 questions. Get at least 2 right and the lesson completes automatically.
You’ll get an explanation for each answer. Signed in? Your results save to your account.
Pass the check. We’ll save the progress.
Answer all 3 questions above and get at least 2 right. You can review the explanations and try again.
Go to the knowledge checkTools, templates, and lesson sources
Tools and templates
Tools open in a new tab so you can keep your place here.
Sources and further reading
Explore the references behind this lesson.
Source & access notes · checked 2026-10-01
Relevant documented module/API behavior inspected during expansion authoring; actual execution evidence is recorded separately. No grant eligibility is established.
Access: Official page retrieved with the web reader on 2026-10-01. Documentation reading does not certify execution in every native tool or browser.
Reuse: Original local practice files, fictional data, worked examples and questions. Concepts paraphrased and linked; source exercises are not copied.
Source & access notes · checked 2026-10-01
Relevant documented module/API behavior inspected during expansion authoring; actual execution evidence is recorded separately. No grant eligibility is established.
Access: Official page retrieved with the web reader on 2026-10-01. Documentation reading does not certify execution in every native tool or browser.
Reuse: Original local practice files, fictional data, worked examples and questions. Concepts paraphrased and linked; source exercises are not copied.
Report a problem with this lesson
Tell us what went wrong. Please leave out personal information and private project contents.