Search an element in a sorted and rotated array | GeeksforGeeks

Explanation for the article: www.geeksforgeeks.org/search-a...
This video is contributed by Harshit Jain.
Read More: www.geeksforgeeks.org/search-...

[@raghavchadha9133]

clear it with some examples ...reading algo we will do it ourselves ,,

[@GeeksforGeeksVideos]

Thanks for the feedback. We have shared this with our contributor. :)

[@akshaydwivedi935]

you are just making a simple algo sophisticated by the way you explain

[@vaishnavigoteti8841]

Great Job Geeksforgeeks! this video is certainly not for the beginners, but for intermediate level programmers. The algorithm was very clearly demonstrated.

[@pman-codes]

How can you pass 0 and n-1 as low and high and compare them with the mid where the array is pivoted in the first place?

[@shwetadk1986]

Giving an example would definitely be better but your explaination is very good, much better than just reading the text. Thanks. Keep making such videos.

[@subham-raj]

*This is what happens when you memorize*

[@sainathpatil6893]

in the solution on last line return search(arr, l, mid - 1, key); -- is it required ?

[@amanjaiswal4847]

7:28 high < low can any one explain what does it actually mean?

[@techwithrajdeep7633]

why it was given if l>h

[@tcob78vaibhavwable95]

can we have more vedios on DE Shaw interview preperation

[@SaifurRahman92]

Intern ka kaam hai ye pakka.

[@kaushikkumar1139]

Thank you for the explanation!

[@satyamgupta5234]

Why are we checking from first element to key element ? How ??

[@praveenchouhan6388]

nice explaination!!!!!!!!!

[@saikumarmadhadi473]

finding pivot will itself take O(n) in worst case, so i guess linear search will also be a considerable option

[@spicytuna08]

i agree. the logic is too complex for O log n method.

[@gsb22]

@@spicytuna08 nope, finding of pivot would be done in O(logn) since we would employ binary search there as well.

[@jaatharsh]

hey GFG thanks fr the video

[@akankshagupta3881]

You just read the algorithm that's it , there is no use of any of your videos. This is very disappointing from your side "geeksforgeeks"

[@spicytuna08]

finding pivot code is too complex. prone for an error. if traversing every element is O(n), use easier method to get a pivot.

[@gsb22]

if you are going to do find pivot using O(n) why do this at all, Simply run linear search then..

[@adityapalavajjhala1841]

ahhhhh

[@vidurbhardwaj4001]

I think you are confused by yourself

[@ragas_]

GfG should just give up this stuff. Extremely confusing

[@vidurbhardwaj4001]

wtf type of explaination

[@hemant_malav]

Isse Accha aap Hindi me explain kare to jada acche se samaj aayega

[@alperozdamar517]

So disappointing. Without explanation reading code line by one doesn't make any sense. Everybody can do it! You need to add clear explanations and examples.

[@karimfarhouti229]

while the array is sorted we don't have to do any search i think ,here's a simple fun int fun(int arr[],size_t t_size,unsigned int n) { if (n

[@AmanGupta-eh4qs]

Top_coder reached here only😅😁