Big O, Refined Calculation, Large N - Discrete Mathematics
Enjoyed this video? Join my Locals community for exclusive content at
drofeng.locals.com!
3 months ago
1
This Discrete Mathematics video explains a Big O calculation that is more refined for algorithms i.e. positive function and large N.
Post your comments/questions below and please subscribe.
Loading comments...
-
2:37
DrOfEng
3 months agoBig O, Refined Calculation, Example - Discrete Mathematics
3 -
6:45
DrOfEng
3 months agoBinary Search Algorithm, Analysis, Big O, O(logn) - Discrete Mathematics
1 -
1:05:50
Tech With Tim
2 years agoBig O Notation & Time Complexity Analysis Explained
43 -
7:27
Zach Star
7 years agoWhat is Computer Science? (Part 2: Algorithms, Computation, and more)
-
8:59
InquisitiveKids
1 year agoGrade 1 - Partial Sums Algorithm
6 -
1:01:54
Math Easy Solutions
9 months agoProblems Plus 7: Calculating π Using the Formula of John Machin (1680 - 1751)
1511 -
2:20
TechSphere
4 months agoExcel - Output results of a calculation from multiple inputs
4 -
29:38
tailgunnerjim
1 year agoSimple Calculations
182 -
15:13
Math Easy Solutions
8 months ago $0.01 earnedProblems Plus 16: The Number e Defined as a Recursive Series
1551 -
6:07
ericntunctu
2 years agoFast algorithm log n to compute n fibonacci number
5