Coding Interview Universitycurated list on GitHubRecommends
Under “Even More Knowledge”
Lecture 8 | Programming Abstractions (video)
0:00 / 0:00
Lecture 8 | Programming Abstractions (Stanford)
Stanford
2.2M subscribers • 18 videos on Hallway
- Recommended by 2 people: 1 in engineering communities and 1 curated list.
- Presented by Julie Zelenski, Stanford Lecturer
Beginner. No background in the topic needed.
90K views18 years ago2 recommendations
Computer scienceProgramming languagesAlgorithmsData structuresC++
Julie Zelenski explains functional recursion, exponential functions, and binary search in this Stanford CS106B lecture.
Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to show a more efficient recursion code. The next example she covers is that of binary search and how recursion is used in this instance. Complete Playlist for the Course: youtube.com/view_play_list?p=FE6E58F856038C69 CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development: scpd.stanford.edu/ Stanford University: stanford.edu/ Stanford University Channel on YouTube: youtube.com/stanforduniversity/Why it's here
2 people recommend thisWhat people say. Recommended as a clear introduction to recursion and binary search for beginners.
u/noppanitin r/compsci • Recommends
On “Where is the best place to read about recursion?”
I watched this link to this video and the whole series 8, 9, 10, 11