is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
You could create a general swap by using reverse(i,j) to swap any i and j and then reverse(i+1,j-1) to reverse all the in-between elements back into place.
- thirdderivative June 26, 2012This swap's time complexity would be O(1) + O(1) = O(1).
Now you can use quicksort, which generally runs in n log n (worst case n^2). What I wonder is if there are any sort algorithms specific to this problem that run in less than n log n (or even O(n log n)), by taking advantage of the full power of the reverse() function.