Home > front end >  The shortest possible time to read fast
The shortest possible time to read fast

Time:10-11

Now if my second post here, and I had just fast lineup, to summarize the fast line of thinking:
START 1: location: find the middle item (z) 2: find goal: pointer to the left (l) is larger than z a stop to the right?????? Right pointer (r) to the left to find a smaller than z stopped?????? Exchange about pointer position elements, 3: continue to step 2, until the left pointer over the right pointer 4: retention: if l is larger than z, keep l and l on the right; If r is less than z retain r items on the left, 5: recursive: the above four steps;
END
Ha ha, I like to simplify the complex process, it is easy to remember and easy to use! I taught myself the front six months, I also in efforts! To Mr!

CodePudding user response:

CodePudding user response:

reference 1st floor hookee response:
  • Related