Back to Results
First PageMeta Content
Theoretical computer science / Search algorithms / Computability theory / Analysis of algorithms / International Olympiad in Informatics / Algorithm / Computational complexity theory / Sorting algorithm / Binary search algorithm / Computer programming / Mathematics / Computing


The International Olympiad in Informatics Syllabus 1
Add to Reading List

Document Date: 2013-02-19 18:00:00

Open Document

File Size: 263,66 KB

Share Result on Facebook

City

Brisbane / /

Company

Ford / Pointers / /

Country

Italy / Canada / Australia / /

/

Facility

University of Waterloo / Comenius University / University of Szeged / University Education / Warsaw University / /

IndustryTerm

software system / software engineering / recursive algorithms / basic algorithms / hard textbook algorithms / worst-case sorting algorithms / sequential processing/search / search trees / storage management / binary search / flow algorithms / exhaustive search / number theory algorithms / software systems / approximation algorithms / model solutions / /

Organization

International Scientific Committee / Comenius University / ACM/IEEE-CS Joint Curriculum Task Force / Warsaw University / University of Waterloo / University of Szeged / Princeton Univ. / /

Person

Gyula Horv / Michal Fori / /

Position

author / /

ProgrammingLanguage

Pascal / /

ProvinceOrState

New Brunswick / /

Technology

Knuth-Morris-Pratt algorithm / Maximum flow algorithms / number theory algorithms / 1.2 5.2 8 Algorithms / worst-case sorting algorithms / Randomized algorithms / Kruskal algorithms / Numerical approximation algorithms / hard textbook algorithms / approximation algorithms / Topological sort Algorithms / Basic algorithmic analysis Algorithm / Greedy algorithms / loop design strategies Brute-force algorithms / Bipartite matching algorithms / undirected graph Shortest-path algorithms / /

URL

http /

SocialTag