OCR MEI MwA A: Tracing an Algorithm: 05 Algorithmic Complexity & Big O Notation

preview_player
Показать описание


  1. TLMaths
  2. Maths
  3. Mathematics
  4. Teaching
  5. Education
  6. A-Level
Рекомендации по теме
OCR MEI MwA 0:04:19

OCR MEI MwA A: Tracing an Algorithm: 01 What is an Algorithm?

OCR MEI MwA 0:06:17

OCR MEI MwA A: Tracing an Algorithm: 02 Example 1

OCR MEI MwA 0:06:59

OCR MEI MwA A: Tracing an Algorithm: 08 Tracing an Algorithm Complexity

OCR MEI MwA 0:08:33

OCR MEI MwA A: Tracing an Algorithm: 04 Example 3

OCR MEI MwA 0:05:42

OCR MEI MwA A: Tracing an Algorithm: 03 Example 2

OCR MEI MwA 0:08:58

OCR MEI MwA A: Tracing an Algorithm: 05 Algorithmic Complexity & Big O Notation

OCR MEI MwA 0:01:00

OCR MEI MwA A: Tracing an Algorithm: 06 Complexity Example 1

OCR MEI MwA 0:01:05

OCR MEI MwA A: Tracing an Algorithm: 07 Complexity Example 2

OCR MEI MwA 0:04:26

OCR MEI MwA G: Critical Path Analysis: 09 Forward and Backward Pass Example 2

OCR MEI Modelling 0:04:52

OCR MEI Modelling with Algorithms: Introduction to the Playlist

OCR MEI MwA 0:05:52

OCR MEI MwA G: Critical Path Analysis: 06 Activity Network Example 3

OCR MEI MwA 0:05:53

OCR MEI MwA G: Critical Path Analysis: 08 Forward and Backward Pass Example 1

OCR MEI MwA 0:07:50

OCR MEI MwA G: Critical Path Analysis: 03 Activity Network Example 1

OCR MEI MwA 0:04:36

OCR MEI MwA G: Critical Path Analysis: 11 Finding Critical Activities & Paths Example

OCR MEI MwA 0:03:20

OCR MEI MwA H: Network Flows: 01 Introduction

OCR MEI MwA 0:07:58

OCR MEI MwA G: Critical Path Analysis: 14 Gantt Charts / Cascade Diagrams

OCR MEI MwA 0:05:16

OCR MEI MwA K: LP Solvers: 08 Network Flows Example 1

OCR MEI MwA 0:20:19

OCR MEI MwA I: Linear Programming: 11 3-Variable to 2-Variable Problem

OCR MEI MwA 0:03:36

OCR MEI MwA F: Dijkstra’s Algorithm: 01 Introduction

**A LEVEL MATHS 0:12:15

**A LEVEL MATHS | STATISTICS: SAMPLING | FULL BREAKDOWN | AQA OCR MEI EDEXCEL**

OCR MEI MwA 0:03:38

OCR MEI MwA G: Critical Path Analysis: 01 Introduction

OCR MEI MwA 0:06:27

OCR MEI MwA H: Network Flows: 02 Feasible Flows

OCR MEI MwA 0:02:19

OCR MEI MwA H: Network Flows: 06 Supersinks & Supersources

OCR MEI MwA 0:03:51

OCR MEI MwA G: Critical Path Analysis: 05 Introducing Dummy Activities

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

Just thought it would be worth mentioning that the complexity only gives an approximation of the run time. For example, the 600 number list would take approximately 180 seconds. I've seen this come up in MEI mark schemes with "approximately" in bold, so it's probably worth remembering. As per usual, brilliant video :)

tsamlynx
Автор

Just a heads-up for OCR A takers, we do need to consider O(log n) for that specification, but it isn't much more complicated than the polynomial ones anyway.
If it has complexity O(log n) and the problem takes 10s for 100 inputs, then it would take 15s for inputs of 1000, because it would be 10×(log(1000)÷log(100)).

spaghettiking