I just started with my "Algorithms" course. But my CS-background is lower than that of an average CS-student (I'm a data science student). Only had intro-2-prog course (Python/Java), that's it.
Cormen states on page 23: "...when working with inputs of size n, we typically assume that integers are represented by c lg n bits..."
- How is " c lg n " derived? It's relation to the input size?
- What calculation/proof is made here?
- Which assumptions should one have to come to this assumption?
- Which CS-field/subject (or academic/uni course?) works/operates with this notation, that should be learned prior to the "Algorithms" couse?