Scribd
Upload
18 views57 pages

Chapter One Part 1

The document discusses the concepts of algorithmic time complexity, specifically focusing on the upper bound of T(n) which represents the worst-case scenario. It also defines the best case (Tbest) as the time taken for the smallest input set and the average case (Tavg) as the time for an average input set. These concepts are essential for understanding algorithm performance.

Uploaded by

hirpaadugna1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views57 pages

Chapter One Part 1

The document discusses the concepts of algorithmic time complexity, specifically focusing on the upper bound of T(n) which represents the worst-case scenario. It also defines the best case (Tbest) as the time taken for the smallest input set and the average case (Tavg) as the time for an average input set. These concepts are essential for understanding algorithm performance.

Uploaded by

hirpaadugna1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 57

1

2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
It computes the upper bound of T(n) and
causes maximum number of execution.

Best Case (Tbest): The amount of time the algorithm


takes on the smallest possible set of inputs.

Average Case (Tavg): The amount of time the algorithm takes


on an "average" set of inputs. It also causes average number
of execution. 34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

You might also like