Compsci 101 Stable Sorting, Lambda, Clever Hangman Part 1 …
Compsci 101 Stable Sorting, Lambda,
Clever Hangman Part 1 of 3
Susan Rodger
October 20, 2020
10/20/2020
Compsci 101, Fall 2020 1
R is for ...
? Random ? .choice, .shuffle, .seed, .randint
?R ? Programming language of choice in stats
? Refactoring ? Better, but not different
10/20/2020
Compsci 101, Fall 2020 2
PFTD
? Sorting in Python and sorting in general ? How to use .sort and sorted, differences ? Key function ? change how sorting works ? Lambda ? create anonymous functions
? Stable sorting ? How to leverage when solving problems ? Why Timsort is the sort-of-choice (! quicksort)
? Clever Hangman ? ? How does it work?
10/20/2020
Compsci 101, Fall 2020
3
Go over Last WOTO from last time
10/20/2020
Compsci 101, Fall 2020
4
WOTO last time ? 1st question
10/20/2020
Compsci 101, Fall 2020
5
WOTO last time ? 1st question
10/20/2020
Compsci 101, Fall 2020
6
WOTO last time ? 2cd question
10/20/2020
Compsci 101, Fall 2020
7
WOTO last time ? 2cd question
10/20/2020
Compsci 101, Fall 2020
8
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.