Question 1.Reorder the following efficiencies from the smallest to the largest:a. 2n3 + n5b. 2000c. 4n+1d. n4e. (n-1)!f. nlog2(n)g. 2klogk(n) (k is a predefined constant)Solution:Efficiency: a measure of amount of time for an algorithm to execute (Time Efficiency) or ameasure of amount of memory needed for an algorithm to execute (Space Efficiency).Non-decreasing order: 2000
Nội dung trích xuất từ tài liệu:
COMPUTATIONAL COMPLEXITY
COMPUTATIONAL COMPLEXITY
Số trang: 5
Loại file: pdf
Dung lượng: 171.23 KB
Lượt xem: 9
Lượt tải: 0
Thông tin tài liệu:
Tìm kiếm theo từ khóa liên quan:
computer engineering electrical engineering computer organization digital logic design Computer Architecture Language Architecture.Tài liệu có liên quan:
-
computer organization and design fundamentals: part 1
188 trang 302 0 0 -
Lecture Computer Architecture - Chapter 1: Technology and Performance evaluation
34 trang 173 0 0 -
Ebook Digital design and computer architecture - David Money Harris, Sarah L. Harris
561 trang 135 0 0 -
Lecture note Computer Organization - Part 2.2: The computer system
194 trang 57 0 0 -
Lecture note Computer Organization - Part 4: The control unit
104 trang 54 0 0 -
Lectures Computer architecture: Chapter 2 - ThS. Trần Thị Như Nguyệt
62 trang 54 0 0 -
Lecture Introduction to computing systems (2/e): Chapter 2 - Yale N. Patt, Sanjay J. Patel
33 trang 53 0 0 -
Lecture Computer Architecture: Introduction
9 trang 50 0 0 -
Lecture Introduction to computing systems (2/e): Chapter 6 - Yale N. Patt, Sanjay J. Patel
31 trang 49 0 0 -
96 trang 48 0 0
