Computer Science - Algorithms - Divide and conquer - Phone Book Search Strategy

Scenario: 'Find "Martinez" in a 1000-page phone book.' Strategy 1 (Brute force): 'Start at page 1, check each page...' Show counter reaching 500+ pages. Strategy 2 (Divide & Conquer): 'Open to middle (page 500). Names start with "M"! Open to middle of remaining (page 750). Too far! Open to page 625.

Edodovivmagarwal
Computer Science - Algorithms - Divide and conquer - Phone Book Search Strategy
Log in

Preparing your experience...

Loading scripts and resources

Comments (0)

0/5000

Comments are reviewed before appearing publicly.

About this Experience

Computer Science - Algorithms - Divide and conquer - Phone Book Search Strategy

vivmagarwal
vivmagarwalJan 29, 2026

Description

Scenario: 'Find "Martinez" in a 1000-page phone book.' Strategy 1 (Brute force): 'Start at page 1, check each page...' Show counter reaching 500+ pages. Strategy 2 (Divide & Conquer): 'Open to middle (page 500). Names start with "M"! Open to middle of remaining (page 750). Too far! Open to page 625.

Details

Computer ScienceAlgorithmsClass 11, AS Level, Class 11, Grade 11, DP Year 1

Engagement

6

Likes

0

Remixes

0

Comments

Browse all experiences