this post was submitted on 13 Jun 2024
29 points (100.0% liked)
Learn Programming
1640 readers
1 users here now
Posting Etiquette
-
Ask the main part of your question in the title. This should be concise but informative.
-
Provide everything up front. Don't make people fish for more details in the comments. Provide background information and examples.
-
Be present for follow up questions. Don't ask for help and run away. Stick around to answer questions and provide more details.
-
Ask about the problem you're trying to solve. Don't focus too much on debugging your exact solution, as you may be going down the wrong path. Include as much information as you can about what you ultimately are trying to achieve. See more on this here: https://xyproblem.info/
Icon base by Delapouite under CC BY 3.0 with modifications to add a gradient
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
What you're asking about (how to learn clever techniques to e.g. turn your naive O(n^2^) algorithm into an O(n log n) one) is the kind of stuff taught in an algorithms / theory course as part of a CS degree. Here are some of the first search results for open content courses I found that look like they cover the right topics:
https://ocw.mit.edu/courses/18-404j-theory-of-computation-fall-2020/pages/syllabus/
http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms
You also might want to consider a combinatorics / discrete math course.
In case others want to get into 18.404j, but don't have the prerequisite knowledge, I made a pretty complete graph of all available MIT courses (at least until 2023) and linked them as a left-to-right dependency graph:
https://thaumatorium.com/articles/mit-courses/mit.drawio.svg
Just search for
18.404j
- it's an SVG, so search works.