What is meant by algorithms?

Question

C++ / C#

They called for an interview. They said there will be testing for knowledge of algorithms. What is meant by algorithms in the pros to prepare?

Answer 1

In simple terms, algorithms are generally accepted solutions to a particular problem.
I would advise you to look at the algorithms from the STL, they often ask specifically for them. If you can tell at least a couple of implementations or close to that, then you will have every chance to appear in the eyes of a mentor as a guide to deep knowledge of the language.
Search Tip: "Basics of Working with STL Algorithms". Happy interview :)

Answer 2

Algorithms are not about programming languages ​​at all. You need a head to translate the algorithm into code in a specific programming language. And often, if algorithms are needed, this head is required to have a structural understanding of the invariants in the algorithm itself, in order, in which case, to dock additional chips on the side. And the head is needed to think about what can be docked at all.
For example, on one of the Olympiad tasks, it was necessary to find a path along a graph, which, being written as a string, had some good properties. But if we apply Dijkstra's algorithm as it is, then we do not pass the memory limit, the heap of nodes is clogged with long lines. However, we take, we think, we notice that Dijkstra's algorithm finds nodes in a convenient chronological order, and long paths can be collapsed by explicitly entering such numbering. And then at the end for the answer to spin back.
Olympiad students have a working language of Pascal, and in the literature on algorithms one could often find it. But here, let's say, in Cormen's book, pseudocode is used, with stripes to the left of the blocks, with arrows to indicate assignment, in general, without reference to the PL. And I would recommend Kormen to look.