Teaching bit-level algorithm analysis to the undergraduates in computer science
Ranjan Chaudhuri · ACM SIGCSE Bulletin · 2004
The paper presents a number of elementary examples which could be used to teach the concept of bit-level algorithm analysis to the undergraduate students in Computer Science. Each of these example algorithms take one or more integer(s) as input in order to output the result. Without a bit-level analysis, the run-time complexities of these algorithms can not be estimated correctly. These simple examples will greatly facilitate learning this new concept.