nn
Questions (1)
Comments (1)
Reputation 20
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.
There is no one sorting algorithm which is best in all cases
- nn January 24, 2017Counting sort is best if given number is within certain range and it also requires space bt it can be done in linear time.
If the given input is represented as linked list then merge sort will be best since it can be done in O(NlogN) time and O(1) space
If we have very few numbers and it is not sorted then quicksort will be best.
If space is a constraint and the input is almost sorted then insertion sort is best.