JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding line breaks

Browse Source
This commit is contained in:
Jidong Xiao
2025-01-28 13:48:41 -05:00
committed by JamesFlare1212
parent 6b20815f75
commit f4b965a62c
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lectures/07_order_notation_recursion/README.md
View File

@@ -94,10 +94,10 @@ if (found) cout << "It is there!\n";
## 7.6 Best-Case, Average-Case and Worst-Case Analysis ## 7.6 Best-Case, Average-Case and Worst-Case Analysis
- For a given fixed size array, we might want to know: - For a given fixed size array, we might want to know:
– The fewest number of operations (best case) that might occur. – The fewest number of operations (best case) that might occur.
– The average number of operations (average case) that will occur. – The average number of operations (average case) that will occur.
– The maximum number of operations (worst case) that can occur. – The maximum number of operations (worst case) that can occur.
- The last is the most common. The first is rarely used. - The last is the most common. The first is rarely used.
- On the previous algorithm, the best case is O(1), but the average case and worst case are both O(n). - On the previous algorithm, the best case is O(1), but the average case and worst case are both O(n).