Akhtar Qureshi
I m an IITIAN
I m an IITIAN
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.
hello friends for this we don't need external sorting
- Akhtar Qureshi September 15, 201210,00,000 instructions
1,000 at a time can sort
if we divide 10,00,000 instructions into 500 blocks
first sort first 2 block
then take last 500 sorted instruction and next 500 unsorted instructions ...sort them
now take first 500 sorted instruction of last sorted instruction and and above 500 instruction and sort them now we have 1500 sorted instruction similarly take next 500 instruction and make 2,000 sorted instruction and so on
for example
we have 16 integer and at a time i can take only 4 integer in memory and can perform sorting over then
5,6,1,3,2,3,1,1,7,6,3,8,8,7,6,5
divide them in block of 2 so it become
[5,6],[1,3],[2,3],[1,1],[7,6],[3,8],[8,7],[6,5]
now take first 2 block and sort them
[1,3],[5,6].......rest are unsorted
now take last sorted block and next unsorted block
and sort them
[1,3][2,3][5,6].....
then recursively sort the previous 2 blocks ([1,3]&[2,3]) until no block to sorted
1,2,3,3,5,6(sorted)........unsorted rest blocks
similarly extend it and finally u get all sorted list
thank u
i hope u understand