السلام عليكم محتاج مين يشرحلي Complexity of Algorithm وايضا Growth of Functions
وكيفية حل مثل هكذا تمارين:
Find O,C, and n0 for the following list of functions:
a) 5n+12
b) 4n5 – 10n3 + 7n2 – 2
Are each of the following true or false?
a) 3n2 + 10 n log n= O(n logn)
b) 3n2 + 10 n log n = Ω (n2)
Find Ω,C, and n0 for the following list of functions:
a) 4n5 – 10n3 + 7n2 – 2
ولكم جزيل الشكر
