@leandrohirt.oficial: Como o Python acha 1 pinguim entre mais de 1 milhão com só 20 chutes? A busca binária pergunta sempre para o pinguim do meio e descarta metade da fila a cada resposta, até sobrar o certo. Funciona com qualquer lista ordenada: números, nomes ou IDs. Aprenda a pensar como o Python resolve problemas assim com o Curso de Python Completo, no link da bio. #python #programação #algoritmos #buscabinaria #logicadeprogramacao

coleawesome :

what a binary search im just a babeh

Francis :

Assumes already sorted

DecoraOctopus :

language 0% understanding 100%

fineriso :

the only problem, it has to be sorted

I_love_the_kites :

return list(range(1, 2**20))[x]

kutayertug :

Binary search only works in sorted data

Кори спит :

когда пингвины лохами для тебя стали?

Roman :

why can't you just search in the whole thing?? I mean you even check if it's in the specific chunk or not

ωαєѵ :

interessante, muitas possibilidades

макулатура :

binary search work only in structure data. also data must has iterator or can transform in integer

5 :

Yes of course it has to be sorted. But if you know you are gonna do a search multiple times in the same list, you should sort it first (and only once) then you search it multiple times at O(log n) time complexity

🇰🇭 ស្មោះប៉ុណ្នឹងមិនល្មម🇺🇸 :

Leave the array unsorted, just pick a random one look at it and put it back. Wouldn’t that be faster, then have to sort them first?

циган :

dichotome method

Мистер Исключительный 🧛 :

Докс по математически

Arison_q :

фором надо было

Say :

big o função logaritma ne ?

Morkovkaa 原明 :

Больше 20, кстати, быть не может. Для тех, кто, возможно, не знает.

Johnny Boy :

busca binaria é o algoritmo, qlqr linguagem tem como implementar ele

Giantara Ihsan Food :

owalah menggunakan bahasa python toh

Voevvxiwnz :

est-ce que cela peut être utilisé comme trouver une personne?

muha_cc :

Linux

acan :

if not sorted?

Канал переносится :

Помогите добить 50 подписчиков

mishasklyar :

pinguin

Dragon :