Fold and Scan

1

Introduction

00:00 • 3min

2

How to Make the Transition From One Potato to Potato Scalar Programming in the Show

02:46 • 2min

3

Version Numbers for the CPQ and Interpreter

04:33 • 2min

4

The Differences Between BQN and K Slash Q

06:10 • 4min

5

The Differences Between Scan and Fold in APL

10:28 • 3min

6

The Math Reason for Wanting a Right to Left Fold

12:58 • 2min

7

How to Write Alternating Sums in APL

14:30 • 2min

8

The Difference Between K and Q in Computer Languages

16:02 • 2min

9

How to Use a Fold to Control Your Program Flow

17:37 • 2min

10

How to Solve a Cadain Algorithm With a Single Fold Primitive

19:41 • 2min

11

How to Do a Scan That Matches APL in J

22:08 • 2min

12

The J Fold and C Plus Plus Algorithm

23:40 • 2min

13

The Advantages of Coding in Array Languages

25:44 • 2min

14

How the Queue Scanned Works

27:36 • 2min

15

The Convergence Form of the Scan Operator

29:49 • 4min

16

The Problem With the Fixed Point Algorithm in K and Q

33:32 • 2min

17

The Importance of Comparing Power Functions

35:27 • 2min

18

How to Solve a J Problem Using a Folder

37:33 • 2min

19

The Advantages of Array Languages

39:21 • 2min

20

The Limits of a Language Is the Border of My Imagination

40:58 • 2min

21

How to Split an Array Algorithm Into Smaller Arrays

42:34 • 2min

22

The Importance of Optimization in Arrays

44:12 • 3min

23

The Importance of Thunks in Collection Oriented Programming

47:07 • 3min

24

The Importance of Fusion in Parallel Execution

49:44 • 2min

25

How to Compile a Sequence of Streams

51:17 • 2min

26

The Relationship Between Scan and Reduce in APL

52:59 • 1min

27

The Advantages of Prefixing the Identity Elements in Binary Operations

54:28 • 2min

28

The Importance of an Array Language

56:10 • 4min

29

The Relationship Between a Scan and a Fold

59:43 • 2min

30

The Problem With Folds in C++

01:01:42 • 4min

31

The Power of Simple Languages

01:05:44 • 2min

32

The Limits of a Library in J

01:07:28 • 3min

33

How to Solve a Problem in an Array Language With Heat Performance

01:10:17 • 2min

34

How to Find the Smallest Window at Every Time

01:11:53 • 2min

35

How to Find the Maximum Overall for the Heap Solution

01:13:43 • 2min

36

O of a Is the Sequence.

01:15:37 • 2min

37

Cadain's Algorithm: A Good Solution?

01:17:25 • 2min