Videos / DSA

Episode 10 of 22 · DSA, end to end

Bit manipulation: the integer as an array of booleans

Chapters

1. A wall of switches0:00
2. Position is value0:17
3. Switches fix the range0:33
4. Invert, then add one0:50
5. One adder for both1:07
6. Three traps1:23
7. Read straight down1:43
8. And filters2:01
9. Or unions2:16
10. Ex or as a flip2:31
11. Not flips the lot2:46
12. Shifting rounds down3:04
13. A stencil with one hole3:25
14. Testing one bit3:41
15. Setting and clearing3:56
16. Toggling is different4:12
17. Isolating the lowest one4:29
18. Counting the ones4:48
19. Turned over twice5:05
20. Order stops mattering5:22
21. The single number5:39
22. Swapping with no temp5:56
23. The missing number6:12
24. Addition without a plus6:31
25. A tick box per item6:46
26. Set algebra, cheaply7:01
27. The two constants7:18
28. Walking the members7:36
29. The submask loop7:55
30. Three to the n, not four8:14
31. Sixty four flags a word8:31
32. The sieve, in bits8:48
33. A million bits a loop9:07
34. The state is a mask9:26
35. The salesman transition9:43
36. Where it stops working10:01
37. The whole thing10:21

Bit manipulation: the integer as an array of booleans. Picture a wall of thirty two light switches. That is an integer: thirty two independent on or off flags, and every arithmetic operator you know is just a rule for flipping them. Bi

Mark as watchedSaved in this browser only.