Little backstory. I am a student (3 course), the other day I went to a large office, participated in the test (Set of interns). Those who passed the test went to the interview. I did not pass. The tasks in the test were of a purely algorithmic type (do something without exceeding the complexity of the algorithm equal to X and not exceeding so much memory). I program all my studies, not 24/7 but with sufficient quality (I think I could have figured out the real problem). In my problems there were almost no algorithmic problems. How to start pumping algorithmic basis? To be more precise, what books can you advise, well, or any advice at all, it will be better.

    2 answers 2

    Books:

    • Kormen "Algorithms. Construction and Analysis"
    • Sedgwick "Algorithms in Java"
    • Knut "The Art of Programming"

    At coursera.org Sedgwick teaches the course:

    And of course, do not neglect the exercises.

    • one
      Thanks for the books :) there are also courses on this (and other) topics from CS club lektorium.tv/university/?id=2677 - ProkletyiPirat
    • 2
      Kormen our all =). However, without practice, you cannot go far, and the best way to learn to understand algorithms is to solve problems. Fortunately there where: acm.timus.ru acm.mipt.ru acm.sgu.ru uva.onlinejudge.org spoj.pl codeforces.ru topcoder.com/tc and others. - Dith

    Construction and analysis of computational algorithms A. Aho, J. Ullman, J. Hopcroft