26. Internationalization

[Page 768 ( continued )]

Review Questions

Sections 23.2 Estimating Algorithm Efficiency

23.1	Put the following growth functions in order:
23.2	Use the Big O notation to estimate the time complexity of the following methods :
23.3	Estimate the time complexity for adding two n x m matrices, and for multiplying a n x m matrix with m x k a matrix.

Sections 23.3 “23.7

23.4	Use Figure 23.1 as an example to show how to apply bubble sort on {45, 11, 50, 59, 60, 2, 4, 7, 10}.
23.5	Use Figure 23.2 as an example to show how to apply merge sort on {45, 11, 50, 59, 60, 2, 4, 7, 10}
23.6	Use Figure 23.4 as an example to show how to apply quick sort on {45, 11, 50, 59, 60, 2, 4, 7, 10}
23.7	Show the steps of creating a heap using {45, 11, 50, 59, 60, 2, 4, 7, 10}.
23.8	Given the following heap, show the steps of removing all nodes from the heap.
23.9	There are 10 numbers {2, 3, 4, 0, 5, 6, 7, 9, 8, 1} stored in the external file largedata.dat. Trace the SortLargeFile program by hand with MAX_ARRAY_SIZE 2.