Computer Science II: Programming Abstractions

Stanford Course , Prof. Julie Zelenski

607 students enrolled

Overview

Contents:
Introduction to Computer Science Series at Stanford - Similarity between C++ & Java:syntax - variable types - operators - control structures-C++ Libraries - Standard Libraries - C++ Console I/O-Client Use of Templates - More Containers - Seeing Functions as Data: Specific Plot Functions - Common Mistakes Stumbled Upon -Thinking Recursively -Refresh: Permute Code - Backtracking Pseudocode

Pointer Movie - Coding with Linked List - Algorithm Analysis - Selection Sort - Partitioning for Quicksort - Sort Template with Callback-Abstract Data Types - Rules of Template Implementation-Live Coding: Recap of the Vector - based Implementation for Stack-Buffer: Vector vs Stack - Map as Vector - Pathfinder Demo - Compare Map Implementations - Lexicon Case Study - Final Showdown - About the C++ Language, Quick History of C++, C++ Philosophy

Lecture 15: Selection Sort

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        3.5 (6 Ratings)

        LECTURES



        Review


        3.5

        6 Rates
        5
        33%
        2
        4
        17%
        1
        3
        33%
        2
        1
        17%
        1

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment