Shelby Simmons Programming Algorithms

Week 1

• Lab Part 1
• Lab Part 2
• HW JS File

Week 2

Lab:

1. The code would be faster if it was only shuffled once, as the shuffleArray function is ran each time the button is pressed.
2. Pop/push takes the first array element and adds it to the end of the array, not changing the total count of elements within the array whereas shift/unshift completely removes the first array element from the array and changes the index for each array element to a lower index.
3. I think shift/unshift works well with the bingo game example as it shows what array element is next and what others remain while shortening the index count for better readability as the game continues. When it comes to the called output I think as long as it is sorted it works well enough especially with the current called number displayed larger than the rest of the data and is in bold text.

• Lab Bingo Shift Change
• HW JS File
• HW PHP File
• HW JS HTML File

Week 3

• Lab Part 1 PHP
• Lab Part 2 JS
• Lab Part 2 JS HTML File
• HW File

Week 4

• Lab Part 1 PHP
• Lab Part 2 JS
• Lab Part 2 JS HTML File
• HW File

HW Part 2: Question

A suggestion-based algorithm can work with any sort of website where the content/products offered are related in some way, whether comparable to other viewed items or frequently purchased/viewed together. This can be done with websites that sell products, blogs, social media, etc. I think PHP is the preferable language for this as it conceals the code used for these algorithms as it contains information to the database.

Week 5

• Lab Part 1 PHP
• Lab Part 2 JS
• Lab Part 2 JS HTML File
• Lab C# File
• HW File Part 1