algorithm - When would it be important to be able to calculate order of growth? -


i'm reading chapter 2 , 3 of clrs, , stuck often, in problems provided @ end of each chapter, wonder if it'll ever worthwhile effort. can't understand solution online one: http://clrs.skanev.com/02/problems/01.html

i heard book 1 of popular text books university cs class, people skip intricate parts , memorize important things, insertion sort has order of growth , merge sort has order of growth, , go ahead?

isn't enough familiar many useful algorithms have understanding of computer science people degree in cs in general?

understanding isn't memorization. it's being able apply knowledge solve problems. textbook problems quite simple compared real-life problems. so, skipping these means you're not learning @ all, , won't able apply of in real life. you're memorizing, can't use you've memorized.

tl;dr: proof of being able use knowledge ability solve problems, , textbook problems simple. 1 doesn't go without other.

‡ knuth's texts notable exception: offers borderline intractable problems, , in between :)


Comments

Popular posts from this blog

ruby - Trying to change last to "x"s to 23 -

jquery - Clone last and append item to closest class -

c - Unrecognised emulation mode: elf_i386 on MinGW32 -