Learning Algorithms Has Never Been This Easy: Crack Any Algorithm Through Stories | Binary Search

Are you tired of traditional methods that make learning algorithms feel like a chore? In this video, I’ll show you a game-changing way to learn algorithms through storytelling! We’re starting with Binary Search, but instead of dry, technical explanations, I’ll guide you through a fun and easy-to-understand analogy using a phone book.
Learning algorithms has never been this easy. Whether you’re a beginner or just want to sharpen your skills, this approach will help you unlearn the old methods and reimagine how you learn!
Subscribe and stay tuned for more episodes in this algorithm series, where we’ll cover other essential algorithms using the same story-driven technique.
Ready to crack any algorithm? Let’s dive in!
#AlgorithmsMadeEasy #BinarySearch #codingtutorial #tamilnadu #tamil #LearnAlgorithms #StoryDrivenLearning #UnlearnAndMaster #AlgorithmSeries #CodingForBeginners #ComputerScience #TechEducation #MasterAlgorithms #CrackAlgorithms #BinarySearchExplained

[@65muralikumarj]

Bro freshers epdi job vangurathu

[@mithunmahaadevan463]

Nice hair cut. All the best for the tournament man, stay healthy. Try incorporating meditation as well. Happy to find a person whose thought process is similar to mine like coding, financial literacy, physical fitness. The content was very useful as always. Please try to improve audio, video and thumbnail as well. With the quality of content you provide you will reach much more audience. If possible make a video on freelancing. Cheers !

[@surya4615]

What tournament bro?

[@Hyps3106]

Bro great video bruh!
If the input is sorted:
Two Pointers
Binary Search
If there are multiple sorted sequences or the input is sorted:
Binary Search
If the problem involves brackets or arrangements:
Stack
Queue
If asked to find the longest, smallest, shortest, etc.:
Backtracking
ipdi entha problem enna method use panalam numsollunga bro it would be helpful

[@jaya_bhuvanesh]

More or less correct but yeah we will cover these things in deep

[@mareeswaran7644]

Nice video bro . waiting for coding explanation 🙂

[@Naveenkumar-oe3be]

Hii bro can you please let me know about scaler devops course?

[@vasuTamizh-ui1kn]

Thala ;
1. If mid is equals to it's previous element,
Start_point= mid+1;
else
End_point = mid - 1;
Thala mid element athoda previous element kooda pair sh irunthuchuna, apo athuku munnadi entha unpaired element um illa, so naama RIGHT move panniklam, apdi illana ithoda pair pinadi irukuna, apo ithuku munnadi tha antha un_paired element iruku.
Ithu correct ah thala ?
pathutu sollunga.

[@jaya_bhuvanesh]

You are thinking in the right way but think how index number will change based on the element occurrence

[@Philomath_CMA]

Hi bro,I've been looking for a job in a top MNC in Accounts and Finance for one year, but I feel exhausted from the search. Could you make videos on how to select an MNC?

[@jaya_bhuvanesh]

I have already added a video reg this , kindly check

[@Philomath_CMA]

@@jaya_bhuvanesh thanks a lot for ur response
I will check

[@Hyps3106]

array = 0 0 1 1 2 2 3 3 4 4 5 5 6 6 7 8 8
target =7
step 1 : mid element
start = 0 end =17
= 0+17/2
mid = 8
array of [8] = 3 which is lesser than target [7] so increase pannanum i mean right side pakanum.
step 2 :
8+17/= 12
mid = 12
arr[12] = 5 which is not equal to target so again increase panrrom so apa 12 - 17 kulla than answer irukkum again right side pakurom.
step 3:
12+17/2 = 14
mid = 14
arr[14] =16 again increase it
step4
14+17/2 = 15
mid = 15
arr[15] = 7 target found

[@jaya_bhuvanesh]

No here the question is to find odd one out element which occurs only once we dont know what that element is

[@Hyps3106]

@@jaya_bhuvanesh
okay bro
If mid is even:
If arr[mid] == arr[mid + 1], the odd element is on the right side.
Otherwise, it's on the left side.
If mid is odd:
If arr[mid] == arr[mid - 1], the odd element is on the right side.
Otherwise, it's on the left side. correct ah bro.

[@lucifersom6985]

Welcome back ↩️ thala

[@Hyps3106]

bro but sorted ah iruntha thaana binary use panna mudiyum if unsorted array question na then sort pannitu binary search panna TC athigam aagume ithukku enna solution

[@jaya_bhuvanesh]

Yeah sometimes data set from the question has to be sorted but for the square root of an number the solution space is sorted right , there you can apply binary search , similarly in number comes only once ,there solution space indexes are sorted , so you gotta think in terms of solution space
In short solution you are looking for the problem lies in a range then you can do binary search there and get your answer faster
Kindly see the video again and try to understand this point its very important

[@nagarajjmr3543]

Engineering aspirants can only get high package comparable to BSC BCA aspirants tell

[@jaya_bhuvanesh]

No not like that!

[@harinivas5983]

Bro ithemari example oda ella algorithm kum podunga bro❤

[@SAKTHI-zr9dw]

Dsa padikka aasa..but..enga eppadi start panna nu theriyala..dsa ku munnadi java padikava venama..

[@dhilip77]

Clear explanation, keep sharing your knowledge.

[@vasuTamizh-ui1kn]

Right uhh vilayadumpothu shoe va pathukonga

[@DarkPrince-tv3sy]

Bro can u do C programming please 🙏 i can understand your teaching

[@jaya_bhuvanesh]

Check out my DSA playlist.

[@phantom_dorex_4573]

Best of luck bro 👍

[@Gopi31563]

Happy to meet you again jaya bhuvanesh
❤😊

[@SasiKumar-k2r]

vaa thalaiva vaa thalaiva vaa

[@hustle4902]

1st like

[@nagarajjmr3543]

There is any eligibility criteria to join Scaler

[@jaya_bhuvanesh]

No