With this book as a guide, you will be able to acquire the necessary knowledge for learning programming, get introduced to the logic of basic algorithms, familiarize yourself with some more complex concepts, and understand them.

After learning the basic steps of programming and getting comfortable with the more advanced ones, you have the opportunity to test yourself on problems that have been solved by Informatics Olympiad winners, those who have represented the National Informatics Team and have received great international distinctions.

It is up to you to excel, following the "journey" of the Olympians, as it is detailed in each chapter of the book.

The book presents:

In Part A (Beginners):

The sequence structure, the selection structure, the repetition structure, arrays, functions, files, and pointers.

In Part B (Advanced):

Complexity, Asymptotic behavior of algorithms, recursive and logarithmic complexity, dynamic arrays, set structure, stacks, queues, data search, greedy algorithms, dynamic programming, graphs, modeling and traversal of graphs, trees, number theory, probabilistic algorithms (Quicksort, Merge Heap, Treap, and Cartesian trees), game theory, problem-solving strategies in the International Informatics Competitions pattern.

In Part C:

Old topics of the Panhellenic Informatics Competition and their solutions.