Beschreibung
Sorting algorithms are considered as one of the most important topics in Computer Science. They are an integral part of many other more complex algorithms. This implies, for both students and programmers, a good knowledge of how a sorting algorithm is defined and what its workflow is. Along with learning the basic ideas behind an algorithm, there are still other open questions: what is the influence of each action? How is the data processed during algorithm execution?
Autorenporträt
Krasimir Markov acquired his Bachelor Degree in Computational Engineering in TU Darmstadt. He completed his dissertation in 2008. An year later he continued his studies in University of Liverpool. In 2011 he acquired Master of Science degree in Information Technology.
Herstellerkennzeichnung:
OmniScriptum SRL
Str. Armeneasca 28/1, office 1
2012 Chisinau
MD
E-Mail: info@omniscriptum.com
