tag:blogger.com,1999:blog-2682781734368178743.post5859452822652535231..comments2011-03-13T22:21:07.250-07:00Comments on Technical Interview Questions, Answers, and Tips: Find an Item in a Sorted Array with Shifted Elemen...avid gardenernoreply@blogger.comBlogger2125tag:blogger.com,1999:blog-2682781734368178743.post-91353571272988980732011-03-13T08:16:01.659-07:002011-03-13T08:16:01.659-07:00Also, one can extend this exercise and ask to find...Also, one can extend this exercise and ask to find a shift. One way to do so could be like this: <br />* Compare first and last array's elements.<br />* If first is less than the last then there's no shift, do a regular binary search.<br />* If first is greater than the last then there is a shift.<br />* Start doing kind of binary search looking for element where previous to it is not Evgeny Goldinhttp://www.blogger.com/profile/10395901293881603925noreply@blogger.comtag:blogger.com,1999:blog-2682781734368178743.post-33847788307943083002011-03-13T08:03:38.280-07:002011-03-13T08:03:38.280-07:00Hi, I did it slightly differently via a regular bi...Hi, I did it slightly differently via a regular binary search with an additional "shift" argument:<br /><br />The code: http://goo.gl/6JcAw<br />The test: http://goo.gl/9Gv3fEvgeny Goldinhttp://www.blogger.com/profile/10395901293881603925noreply@blogger.com