Indirect Addressing uses how many bits?

This is a discussion on Indirect Addressing uses how many bits? within the C Programming forums, part of the General Programming Boards category; Hi guys,
I got 2 questions, hope you won't find it stupid....
1) How many bits does indirect addressing use? ...

Er... I'm totally blur about secondary memory algorithms. This phase is given to me by a professor and I dare not keep mailing him questions, I'm afraid he might be irritated by me....

Thus, I post it on this forum...

Traditionally, "secondary memory" refers to external storage on mainframes (9-track tape drives, magnetic drums, etc.) This is contrasted to "primary memory" which in contained in the CPU. Programs that need more memory than the amount of CPU "core memory" must store parts of the data base externally.

A sort algorithm specifically fine-tuned for a large data base in secondary storage may very well be different from a sort algorithm optimized for a smaller data base that can be contained in core.

For example some sorting algorithms require repeated access to elements near the first and near the last, whereas others require more accesses, but the accesses are more-or-less sequential. If the external storage has a large access time for elements that are not near each other (like tape drives), you really would like to see successive accesses more-or-less sequential.

With the advent of operating systems with virtual memory, (where large parts of programs and data bases are rapidly shifted between core and external memory in a way invisible to the programmer) the importance of the difference in such algorithms has pretty much been lost on most rank-and-file programmers, except as a mild historical oddity.