how to code racket 128 - binary search (generative recursion algorithms)

jest learn how to code and program well for absolute beginners 0:00 generative recursion intro 0:55 PROBLEM A linear-search intro 1:32 linear-search SPOILERS CODE 3:10 linear-search refactor 4:47 PROBLEM B binary-search intro 7:24 book analogy 9:09 binary-search signature, purpose, stub 10:23 binary-search SPOILERS check-expect, examples, and tests 11:58 binary-search SPOILERS CODE 17:51 binary-search helper function spoilers, left and right half 19:51 running binary-search against the tests 20:45 fixing infinte loop with debugger 25:33 BUG2! should be (add1 mid-index) instead of ceiling! 27:03 benchmarking linear-search vs binary-search 29:55 final recap Exercise problems and writeups: https://howtocode.pages.dev/ Practice Problems: https://jestlearn.com/how_to_code/ Installation and DrRacket configuration settings: https://howtocode.pages.dev/installation Download Racket: https://racket-lang.org/download/ Why all the parenthesis?: https://howtocode.pages.dev/introduction#why_all_the_parenthesis? Join us on discord, feel free to ask for help: https://discord.com/invite/6Zq8sH5 patreon: https://www.patreon.com/jestarray/