Algoritmi in podatkovne strukture 1

Programiranje brez poznavanja algoritmov in podatkovnih struktur (APS) je kot trenje orehov brez kladiva - gre bolj počasi, lahko ostaneš lačen. Pri APS bomo za različne vrste orehov spoznavali različna kladiva. Za orehi se seveda skrivajo računalniški problemi, za kladivi pa postopki reševanja problemov in hranjenja podatkov. Če uživate v programiranju, boste po APS še bolj.

Računalniškim postopkom bolj umetelno pravimo tudi algoritmi, načinu hranjenja podatkov pa podatkovne strukture. Spoznali boste algoritme za različne probleme. Tako se boste naučili hitro množiti, urejati karte na sto in en način, iz velikh problemov delati manjše, požrešno zlagati stvari v vrečke in še in še - življenje vam bo postalo popolnoma jasno in enostavno. Razkrite vam bodo dobro varovane skrivnosti podatkovnih struktur. Spoznali boste, da računalniški podatki niso le števila, nizi in tabele, ampak obstajajo tudi skladi, vrste, seznami, drevesa, kopice, grafi itd. Od daleč boste prepoznali, kateri algoritem je hitrejši in katero drevo je višje - vaše ali sosedovo. Še več, spoznali boste različne metode za reševanje življensko pomembnih problemov in nenazadnje naučili se boste napisati hitrejši in lepši algoritem kot sosed. Razen, če seveda vaš sosed ni poslušal APS.

"May the source be with you."without knowledge ofalgorithms and data structures(ADS)is like cracking nuts without a hammer - goes slowly and makes you hungry. ADS is about different types of nuts and hammers. Behind nuts hide computational problems, and behind hammers receipts for solving the problems and data storage approaches. If you enjoy programming you will enjoy ADS.

Receipts are rather called algorithms and storage approaches data structures. You will learn algorithms for various practical problems, such as how to quickly multiply, to sort cards, to divide big problems into smaller ones, to greedily pack things into bags and so on - you life will become vivid and simple. You will be introduced to hidden secretes of data structures. You will learn that computer data is not only numbers, strings and arrays, but also stacks, queues, lists, trees, heaps, graphs, etc. You will easily recognize which algorithm is faster and which tree is higher - yours or neighbour's. Even more, you will learn various methods for solving the problems and, finally, how to make an algorithm faster and better than your neighbor. Unless, of course, your neighbor did listen ADS.

"May the source be with you."