@_coffeebits_: How does Linear Search work? 🔍💻 - Visualization The most basic way to find an element! Linear Search checks every item in the list one by one until it finds a match. Simple and effective for small datasets! #linearsearch #coding #programming #Tech #computerscience #developer #algorithm #fyp #foryou #techtok

valo.pocketsage :

Binary search, half the time with doubled efficiency

shon445 :

just go faster and it’ll be better

CallMeChris (I ❤️🇧🇬🇳🇺🇼🇫) :

happy wheels mentioned

𝐅∅∅𝐋 🇺🇸🏹🎮🔥 :

Mistergoose14 :

Typa sound😭

. :

const func = (arr, target) => { return arr.indexOf(target) }

Bobby Johnson :

Now what if we tripled the search speed…… n/3 🔥🔥🔥

⠀ ⠀ ⠀ ⠀ ⠀ ⠀ • following :

why not just do | def search(arr: list, target): | for index, value in enumerate(arr): | if value == target: | return index | return -1

fast fourier t :

happy wheels victory sound

vixyn :

“hip hip hooray!!” ahh sound 😭😭

theophilus :

data looks sorted, just use binary search

Crelesetiox :

Season 2 is crazy, we dropping sorting and switched to searching

AdamScoutsPCs :

Now hear me out, you should’ve went from right to left here, would’ve been faster

Timigne :

Too long, just randomly pick one element until it’s the right one. And don’t remember which element has been picked as it would consume too much ram.

Goose :

king :

bogosearch

CellMatter :

I know this audio from somewhere

⠀ :

holy peak mentioned 🥹✌️❤️

CheezyFuzz :

happy wheels

ܓܓܛܓ :

what does arr means?

Scug :

What’s the search that looks at every element at once to find target, only able to be run on stupidly powerful computers

Makaveli :

bogo search 💀

Michael Honig :

Hashmaps watching this 😩

Nosh1ts :

“Hello once again audience”

Marci :

the same with logarithmic search?