Unformatted text preview: ∼ skiena/373/programs, there are a collection of seven short C language programs, all of whose time complexities are a function of n . After compilation, each executable accepts an integer value n as its command line argument. • Using the Unix time command, run each of the executables for various values of n , and graph the results. • Does the eﬃciency of each program behave roughly as expected by theory? Do not spend too much time on this problem if you have trouble compiling the programs (use the lm option). 2. Problems 117 and 119. 3. Problems 27 and 2.8 4. Problem 219. 5. Problems 221 through 2.24. 6. Problem 32. 7. Problem 34. 8. Problem 310. 9. Problem 311. 1...
View
Full Document
 Spring '08
 Hart,G
 Algorithms, Data Structures, Computational complexity theory, Prof. Steven Skiena, programming challenges problems

Click to edit the document details