Gallery
Discover apps people built on Collabby by chatting. Run them, then remix to make them yours.
Where Is It Hiding?
🔎 How many tries does it take to find a strawberry in an 8-slot list? With linear search, switching direction from front to back drops tries from 7 to 2! But use the wrong stop rule and you might grab the wrong item. ✂️ With binary search, checking the middle cuts half the list every time — solving 16 slots in 3 tries and proving a missing number in 4. 🏷️ With direct lookup, labeling each slot lets you find anything in just 1 try, even with 100 slots! Built with code · Remix it to try your own list!
#coding#codingbasics#search+4
by Anonymous⭐ 1🍴 0