5.3.2 - Algorithms & Algorithm Analysis - Input Sizes of Numbers

preview_player
Показать описание
We provide a supplemental video discussing how to quantify the input size to an algorithm when the input is a number.

0:00 Input sizes of numbers
0:18 Analysis
1:49 Why it matters

This video series was designed for Computer Science II (CSCE 156) in the School of Computing at the University of Nebraska-Lincoln.
  1. Chris Bourke
  2. Computer Science II
  3. CSCE 156
  4. University of Nebraska-Lincoln
  5. College of Engineering
  6. Department of Computer Science & Engineering
Рекомендации по теме
5 Tips to 0:06:15

5 Tips to Learn Algorithms WAY FASTER

Union Find in 0:05:46

Union Find in 5 minutes — Data Structures & Algorithms

OLL WITH ONLY 0:04:18

OLL WITH ONLY 2 ALGORITHMS?!?!

Lec29 Page Replacement 0:16:18

Lec29 Page Replacement Algorithms | LRU and optimal | Operating Systems

10 Sorting Algorithms 0:10:48

10 Sorting Algorithms Easily Explained

What is Your 0:00:24

What is Your Favorite 3x3 Algorithm? 🤯

QuickSort in 3 0:02:58

QuickSort in 3 Minutes

Page replacement Algorithms 0:09:50

Page replacement Algorithms | OPTIMAL | Example | OS | Lec-28 | Bhanu Priya

Did you know 0:00:22

Did you know about Pareto principal of dsa. #shorts #dsa #firstshort #faangprep #leetcode #gfg

Use the 3-2-1 0:00:26

Use the 3-2-1 method to remember what you studied

Rubik’s Pyraminx last 0:00:15

Rubik’s Pyraminx last layer algorithm. flipped edge solution!

Flipped Edge F2L 0:00:35

Flipped Edge F2L Case FASTEST ALGORITHM!

ILLEGAL RUBIK'S CUBE 0:00:44

ILLEGAL RUBIK'S CUBE ALGORITHM??

How I Solve 0:00:36

How I Solve a Rubik's Cube in UNDER 10 Seconds!

1x1 2x2 3x3 0:00:33

1x1 2x2 3x3 4x4 5x5 17x17 19x19

Harvard Professor Explains 0:25:47

Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED

PLL algorithm easy 0:00:27

PLL algorithm easy method. #shorts

How To Solve 0:00:23

How To Solve a Rubik’s Cube Under a Second

How to Remember 0:00:39

How to Remember OLL PARITY! Easy tutorial #cubing

Computer Science Basics: 0:02:30

Computer Science Basics: Algorithms

Optimal Page Replacement 0:02:59

Optimal Page Replacement Algorithm in Operating System | Example | #computerscience #os

Learn this EASY 0:00:19

Learn this EASY Parity OLL Algorithm!

5 Simple Steps 0:21:27

5 Simple Steps for Solving Dynamic Programming Problems

algorithm & flowchart 0:00:16

algorithm & flowchart problem #shorts #c programming

Комментарии
Автор

Great presentation, but one question that comes to my mind is if we are analyzing for example the factorial function 4!=4*3*2*1 and 5!=5*4*3*2*1 but represented using the same number of bits i.e i.e same input size but the number of basic operations is different which is counter intuitive to my understanding, furthermore multiplication is always regarded as a constant time operation but if we choose the the number of bits as the size metric we have to also include it in the analysis am I correct ?

fjkldhakljf
welcome to shbcf.ru