0 penilaian0% menganggap dokumen ini bermanfaat (0 suara)
228 tayangan5 halaman
The document discusses algorithms analysis and complexity analysis. It covers analyzing algorithms for correctness, simplicity, and performance. Performance analysis measures space and time complexity, including best, average, and worst cases. Space complexity looks at memory usage, while time complexity estimates execution time using Big O notation to classify algorithms as constant, logarithmic, linear, polynomial, or exponential time. Amortized analysis averages costs over operations. There may be time-space tradeoffs between algorithms, depending on memory or time constraints.
Deskripsi Asli:
Datastructure with algorithm of Time and space complexity
The document discusses algorithms analysis and complexity analysis. It covers analyzing algorithms for correctness, simplicity, and performance. Performance analysis measures space and time …