Hacker Courses The online courses programmers keep recommending, ranked from 20 years of public forum comments.
i
#411 overall

Algebra

Khan Academy

1 recommender · 1 thread · recommended in 1 year, 2015 · score 1.0

Search for it ↗

Khan Academy's free online algebra course covering foundational algebra topics in short video lessons with practice exercises.

Commenters point to Khan Academy's algebra and calculus courses as awesome and a good way to build the prerequisite math needed for CS topics.

Mathematicsbeginnerfreemixed#algebra#prerequisites#khan academy#math foundations

Recommendations by year

20062026

What commenters said (2)

  1. RecommendsdeepGem2015in “Deep neural network written from scratch in Julia”

    Go for it! Khan academy calculus and algebra courses are awesome. Also, Calculus One on Coursera is really good.

  2. Mentionsnitrogen2013in “What does O(log n) mean, exactly?”

    Big O notation is an expression of a theoretical concept that applies to the algorithm itself. It is independent of any hardware that might be used to implement an algorithm.

    Specifically, asymptotic complexity is an expression of the number of abstract operations or units of memory an algorithm will require. The meaning of "operation" or "unit of memory" depends on the algorithm. In the case of comparison sorting algorithms, for example, the operation in question is the number of comparisons.

    Even if the CPU time allotted to a running algorithm changes due to system load or overheating, the algorithm still performs the same number of operations. Actual running time under system load can be calculated, but this is unrelated to big-O notation or complexity.

    --------

    Regarding your explanation, it is excessively wordy and uses awkward phrasing. Your subsequent complaint about the terminology used in responses to your previous questions about P=NP demonstrates a serious lack of prerequisite knowledge. You learn the definition of "polynomial" in algebra; teaching you algebra is far beyond the scope of a discussion on HN.

    As someone who is primarily self taught but also finished most of a college CS education, I can understand your frustration. In order to understand one thing you need to learn three other things, and there's no map that leads you from what you know now to what you want to know. Until someone makes that map, or you know enough to make up that map as you read Wikipedia, you'll have to learn things in the order they're taught in school.

    So here's what you should do if you want to understand what people are talking about on HN:

    1. (Re)learn basic algebra from start to finish. Use Khan Academy. You absolutely need this to understand what a polynomial is.

    2. Accept Wikipedia as a source of information. Use a dictionary and other Wikipedia articles to look up terms you don't understand.

    3. Related to #2, try to study cognitive biases, critical thinking, and logical fallacies. Studying these concepts will help your brain process information, such as difficult to understand Wikipedia articles. Check out lesswrong.com.

    4. Study basic CS. Look for an Introduction to Computer Science course on Coursera or elsewhere.

    5. Study algorithms. Take an algorithms course on Coursera or elsewhere.

Related courses

Keyboard

In the course grid
←↑→↓
Move between courses
Home End
Start / end of row (with Ctrl: first / last)
PgUp PgDn
Jump several rows
Enter
Open course
S
Save / unsave course
1–5
Best, Trending, Hidden gems, Evergreen, Saved
[ ]
Previous / next topic
On a course page
← →
Previous / next course in your list
S
Save / unsave
O
Open the course website
Esc
Back to the grid
Everywhere
/
Search
T
Light / dark theme
?
This help