Theory of algorithms. Where to start and which language to choose?

Question

Programming

Hello! Interested in the theory of algorithms, I think it's quite interesting. In this regard, the question arose about where to start. From what literature, and most importantly, what language to choose for the study and implementation of algorithms? Is C a good fit for this? Or is there a special language for learning algorithms. It would be great to learn a language that is as sharp as possible for the study of the theory of algorithms.
Thank you for your attention.

Answer 1

The theory of algorithms works even with the abstract machines of Post and Turing, it does not need a PL for it.
Choosing a language means choosing a way to implement algorithms. Languages ​​with rich runtime and managed code make it possible to achieve high programmer efficiency in terms of algorithm implementation speed. However, their use contributes to writing cumbersome, resource-demanding code.
Languages ​​that are close to hardware, like C and C++, on the contrary, allow you to implement algorithms using the hardware capabilities of the platform as much as possible. Such a programmer is less efficient (produces fewer completed tasks per unit of time), but his code is efficient and can use all the features of the hardware.
Writing code in C and C++ makes more demands on the programmer and the quality of his work, makes you take into account more details and disciplines you more. In this sense, such languages ​​are better suited as teaching languages.

Answer 2

Python is quite easy to learn algorithms. The entry threshold is minimal.

Answer 3

This question is asked so often here that it seems like no one uses the search.