A study of algorithms analysis, algorithms' performance, and algorithms' mathematics in Computer Science. Topics covered are algorithm analysis, asymptotic analysis, sorting, recursion trees, divide and conquer, hashing.
Vesc is a Software Engineer with great deal of industry experience. Vesc also has an awesome theoretical background in Computer Science, graduating with a Masters of Science in Computer Science degree from one of the top computer science programs in the world - the Computer Science department of Stanford University. While at Stanford Vesc was a co-author of two published papers in the computer science journals, and has been a presenter of his research at conferences. His thesis explored the creation and theory behind file systems optimized for content sharing and creation. Vesc has always been fascinated by algorithms and the mathematics that help us solve complex computer science problems and analyze the performance of our solutions.