We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4
Computational thinking
Program Output, the print Statement, and "Hello World!"
Comments Operators Variables and Assignment Numbers Strings Lists and Tuples Dictionaries Code Blocks Use Indentation if Statement while Loop for Loop and the range() Built-in Function Functions Exercises Statements and Syntax Variable Assignment Identifiers Basic Style Guidelines 5. Numbers Introduction to Numbers Integers Floating Point Real Numbers Operators Built-in Functions Related Modules Exercises 6. Sequences: Strings, Lists, and Tuples Sequences Strings Strings and Operators String-only Operators Built-in Functions String Built-in Methods Special Features of Strings Related Modules Summary of String Highlights Lists Operators Built-in Functions List Type Built-in Methods Special Features of Lists Tuples Tuple Operators and Built-in Functions Special Features of Tuples Related Modules *Shallow and Deep Copies Exercises 7. Dictionaries Introduction to Dictionaries Operators Built-in Functions Built-in Methods Dictionary Keys Exercises 8. Conditionals and Loops if statement else Statement elif (a.k.a. else-if ) Statement while Statement for Statement break Statement continue Statement pass Statement else Statement... Take Two Exercises 1 Why Data Structures Matter Data Structures The Array: The Foundational Data Structure Measuring Speed Reading Searching Insertion Deletion Sets: How a Single Rule Can Affect Efficiency 2. Why Algorithms Matter Ordered Arrays Searching an Ordered Array Binary Search Binary Search vs. Linear Search 3. O Yes! Big O Notation . Big O: How Many Steps Relative to N Elements? The Soul of Big O An Algorithm of the Third Kind Logarithms O(log N) Explained Practical Examples 4. Speeding Up Your Code with Big O Bubble Sort Bubble Sort in Action The Efficiency of Bubble Sort A Quadratic Problem A Linear Solution 5. Optimizing Code with and Without Big O Selection Sort Selection Sort in Action The Efficiency of Selection Sort Ignoring Constants Big O Categories 6. Optimizing for Optimistic Scenarios Insertion Sort Insertion Sort in Action The Efficiency of Insertion Sort The Average Case A Practical Example 7. Big O in Everyday Code Mean Average of Even Numbers Word Builder Array Sample Average Celsius Reading Clothing Labels Count the Ones Palindrome Checker Get All the Products Password Cracker 8. Hash Tables Hash Tables Hashing with Hash Functions Building a Thesaurus for Fun and Profit, but Mainly Profit Hash Table Lookups Dealing with Collisions Making an Efficient Hash Table Hash Tables for Organization Hash Tables for Speed 9. Crafting Elegant Code with Stacks and Queues Stacks Abstract Data Types Stacks in Action The Importance of Constrained Data Structures Queues Queues in Action 10. Recursively Recurse with Recursion . Recurse Instead of Loop The Base Case Reading Recursive Code 11. Learning to Write in Recursive Recursive Category: Repeatedly Execute Recursive Category: Calculations Top-Down Recursion: A New Way of Thinking The Staircase Problem Anagram Generation