Shortcut for chapter specific information

Showing posts with label merge sort CLRS pseudocode. Show all posts
Showing posts with label merge sort CLRS pseudocode. Show all posts

Thursday, May 5, 2011

Status at 20110505

Finished Exercise 2.3-2, 2.3-3.

2.3-3 is trivial.  2.3-2 though, I just translate my C-code back to CLRS style of pseudocode.  It is long, just the MERGE function takes 22 lines.  I bet there is a better way to do it.

Browse Read: 236/1144
Exercises Up To: 2.3-4
Exercises which are finished but not on paper: 2.3-7, 6.1-7, 6.2-3, 6.2-4, 10.1-6 and 10.1-7.

Finishing merge sort gives me a boost.  The basic form is not tough but it's quite involved.  Young me could have used more than a day to program it without knowing what goes wrong.   In any case, probably data structure should be learnt when one is proficient in one particular programming language.   (Or as I suspect, one should learn another language to appreciate what "language" means.)

Thursday, April 28, 2011

Merge sort 1 (CLRS pseudocode)

Wrote the first CLRS pseudo.   After some thought, it is clear to me my first real implementation in merge sort should be in perl or python first.  Because writing in C will require me to get the memory allocation correct.   Technique exists to just use one working memory to solve the problem.  But they are certainly not the same as the style from CLRS.

Also read through 5.2.4 by DEK,  I don't thoroughly understand it.