|
|
(451 intermediate revisions by the same user not shown) |
Line 1: |
Line 1: |
− | == Tuesday (11/13/18) == | + | == [[APCS - Archives]] == |
− | '''Agenda:'''
| |
− | * Bubble sort questions?
| |
− | ** Bubble sort should be done by now
| |
− | * NetBeans installation check
| |
− | * JGrasp installation check
| |
− | * JGrasp canvas visualization practice
| |
− | ** Simple variables
| |
− | ** Array
| |
− | ** Loop
| |
− | * Insertion Sort Assignment
| |
− | *# Study the insertion sort visualization [https://visualgo.net/bn/sorting VisuAlgo]
| |
− | *# What are the major components of the algorithm? (e.g. Loop that iterates through array from beginning to end) Others?
| |
− | *# Implement insertion sort
| |
− | *# Create your own data set and demonstrate your code for credit. Be prepared to be able to explain how your code works
| |
− | *# Submit you code via Repl.it
| |
− | | |
− | == Wednesday (11/8/18) ==
| |
− | '''Agenda:'''
| |
− | * Selection sort assignment in repl.it should be already complete
| |
− | * Watch the bubble sort visualization at [https://visualgo.net/bn/sorting VisuAlgo]
| |
− | ** Watch it multiple times until you have a firm understanding of what is happening
| |
− | ** You can also read slide 5 about bubble sort in the [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]
| |
− | * There is a bubble sort repl.it assignment posted with guided comments. Implement bubble sort using the guided comments. You can copy-paste the comments into NetBeans to develop your code. Be sure to submit your finalized code into repl.it for bubble sort
| |
− | * Future assignments will implement insertion sort and merge sort algorithms. You are encouraged to watch the [https://visualgo.net/bn/sorting VisuAlgo] visualizations to understand those algorithms
| |
− | | |
− | == Monday (11/5/18) ==
| |
− | '''Warmup:'''
| |
− | # Assume you have a given int[] named arr
| |
− | # Assume you have two int variables named a and b
| |
− | # Write the code that would swap the elements in arr located at indices a and b
| |
− | #* e.g. swap the elements arr[a] and arr[b]
| |
− | | |
− | '''Agenda:'''
| |
− | * Complete the Find Minimum & Maximum repl.it
| |
− | * Group sorting activity
| |
− | *# Form 3-4 person groups
| |
− | *# Receive playing cards
| |
− | *# With your group, document step-by-step an algorithm (steps) of how you sort the cards out
| |
− | *# Every group will share their algorithm in class
| |
− | *# Paste your sorting algorithm in this [https://docs.google.com/document/d/1Jh9Uz3FdomH2cB9VKUSTfL_BSluWEoROHmhwbpM_qaA/edit?usp=sharing group document] - Don't forget to put your names
| |
− | * Introduction to Sorting
| |
− | ** [https://docs.google.com/presentation/d/1Y5JOINM2w744nqimZf2iVuFpi6N6gM2B7GM4ArGjChQ/edit?usp=sharing Sorting slides]
| |
− | * Complete Selection sort assignment in repl.it
| |
− | | |
− | == Thursday (11/1/18) ==
| |
− | * While loops quiz
| |
− | * [https://docs.google.com/presentation/d/1GLpwZbqLcyix2WHqS9lLJT3qCeIeWGQ9UDwr6f9VgoE/edit?usp=sharing Search slides]
| |
− | ** Linear Search
| |
− | ** Binary Search
| |
− | * LS and BS assignments will be posted in Repl.it
| |
− | * Complete LS and BS by Monday (11/5/18)
| |
− | | |
− | == Archives ==
| |
− | * [[APCS - 1819 - October]]
| |
− | * [[APCS - 1819 - September]]
| |
− | * [[APCS - 1718]]
| |
− | * [[APCS - 1516]]
| |