Search an element in sorted and rotated array( Find PIVOT)

preview_player
Показать описание
Search an element in sorted and rotated array. FInd pivot element in sorted and rotated array. Use Binary search to find pivot and then to find the element. O(log n) is the time complexity.
Рекомендации по теме
Комментарии
Автор

Great video. One very important point I realized that for finding mid we should use start + (end -start)/2 instead of (start + end)/2. This will help to handle int overflow error when array is big.

riteshparkhi
Автор

Thank you ... you are doing great job for us...smoothly explained even all the smallest term to heighest term...

ankitranjan
Автор

Please continue posting videos, very good explanation

MargulanTukhfatov
Автор

Thank you so much .. Really helpful .. Slow and steady, so it is understandable even for beginners..Thanks a lot.

fathimasyed
Автор

Sir you are great in explaining these concepts!

swastikkanjilal
Автор

Thanks😊 for the effort ur putting in. They're very helpful

ManishaKumari-yvnf
Автор

Great explanation for pivot element. Thanks

munishkumararora
Автор

Great Explanation. Never stop making videos.

karthikk
Автор

Do mention also, how to go about duplicate elements in the array. Nice explanation anyways !!

priyaranjanPanda
Автор

Sir please make videos on timecomplexity

lokeshsistu
Автор

thanks. can you please do serialising/deserialising a string to a binary tree?

mikelee
Автор

Hi Vivekananda, please change the condition where a[s] > a[mid] here it should be a[s] < a[mid] to select the portion from "s" to "m-1"

SunilKumar-cuwm
Автор

is this code correct when we have duplicate elements in a array?

LakshyaK_SE_
Автор

will this algorithm work when the array has either 1 or 2 elements?

maheswarreddyu
Автор

i like your videeeos sir... plz keep making videos

helloyou
Автор

. Given a binary string (e.g. 01, 101, 011), in each iteration 0 becomes 01 and 1 becomes 10, find kth character in the string after nth iteration
simple approach, time complexity, express time complexity in terms of n only
efficient approach, explanation, time complexity. can u please make a video to solve this problem

sammanluitel
Автор

Thanks, I've always looked at ur utube explanations. They are great and saved me a lot of effort. But please have a better mic LOLOL

yuanhe
Автор

can u make a video on shuffle a deck of cards in array or randomize a given array

sravankumar
Автор

Thanks a lot for great explanation.
Please make a video on removing duplicate elements from Array
Thanks in advance...

Saurabhnaik
Автор

Hi the video is awesome and super easy to understand, keep it going.

Small suggestion : -
But kindly record with a better mic as there seems to be lot of noise in the background.

knightganesh