Group Activities for today:

• Ice breaker: do you eat leftover pizza hot or cold? Ans: Hot

• Create a Notion page at the bottom of this page for your group (if you haven’t already), and spend a few minutes playing around with Notion features.

  • Each student in the group should:

    • [x] Type some text

    text

    • [x] Type some code

    def hello():
    	print("Hello")
    

    public static void main(String[] args) {
    	System.out.println("Hello World!");
    }
    

    • [x] Type an equation

    $$ a = 2 $$

    $F = ma$

    $$ a_n = 2n + 5 $$

    $$ x = y $$

    • [x] insert an image

      • [x] hide the image behind a toggle
    • [x] add a to-do list
      • [ ] hmm
      • [ ]
      • [ ] new to-do list
    • [x] change the color of text

    Text Here

    • [ ] tag a person in your group or @Lian Duan

    @Youssef Aithmad

    @Yuki Kawahara

• Complete the following activities. You can copy the questions into your own page, but if you do, try to have your answers in a different color.

  • [ ] What's an algorithm?

    A specific process to be followed to solve a problem

  • [ ] What algorithms do you know? Write at least 3 that you know of individually, then share and compare with the others in your group (think about your other classes - 127, 128, discrete, etc)

    dp, greedy

  A*

  Alpha-beta pruning

  • [ ] What is pseudocode? Pick ONE algorithm from your group, and try to write it out in pseudocode.
  • [ ] Look at the code below for Insertion Sort, written in pseudocode (note that the textbook's format may be a bit different), and see if you can figure out what it's doing (as a group)
  • [ ] Trace through the code using the sample array below and write how each iteration (or pass) through the loops causes the array to change. Make sure you are writing out every pass, don’t just skip to the end 🙂

[24 | 21 | 55 | 8 | 76 | 6 | 2 | 66 | 50 | 82]

Algorithm InsertionSort(dataList)
// dataList is a zero-indexed list/array of sortable data
// n is the length of dataList
// algorithm modifies the dataList; returns the modified list
for i = 1 to n-1 do
	let j = i
	while j > 0 and dataList[j] < dataList[j-1] do
		swap dataList[j] and dataList[j-1]
		let j = j - 1
return dataList

Pizza: Hot or Cold?