HomePage | RecentChanges | Preferences

Difference (from prior author revision) (major diff, minor diff)

Changed: 1,19c1


See Also: DataStructures

Sound of Sorting

MIT OCW 6.042J Mathematics for Computer Science

MIT OCW 6.006 Introduction to Algorithms

MIT OCW 6.046 Design and Analysis of Algorithms "Computer A, running the linear search program, exhibits a linear growth rate. The program's run-time is directly proportional to its input size. Doubling the input size doubles the run time, quadrupling the input size quadruples the run-time, and so forth. On the other hand, Computer B, running the binary search program, exhibits a logarithmic growth rate. Doubling the input size only increases the run time by a constant amount (in this example, 50,000 ns)."

Graphing and Solving with WolframAlpha

HomePage | RecentChanges | Preferences
This page is read-only | View other revisions
Last edited December 22, 2019 5:43 am by (diff)