MoreDat

A Student Network for Collaboration and Sharing

Signup on MoreDat.com

What’s Next For Electronic Devices. Have you heard of FPGAs? Find out now here. And as a bonus get your free guide to writing a successful resume. Just Signup now and it’s all yours free.

Lecture 16 | Programming Abstractions (Stanford)

Watch it on MoreDat.Com

Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

Julie continues with sorting, specifically quadratic and linearithmic sorting methods, and then explains how to reasonably partition data sets for quicksort. Thereafter, she proceeds to go over different functional templates for sorting algorithms and also briefly goes over instantiation errors and how to fix them.

Comment

You need to be a member of MoreDat to add comments!

Join MoreDat

© 2020   Created by Jerome Trent.   Powered by

Report an Issue  |  Terms of Service