Won't You Be My Neighbor?

A WebApp to test out function writing using loops and arrays

Technologies Used:

Clone this repository to your desktop
Navigate to the top level of the directory
Open index.html in your browser
All you need to view this site portfolio is an internet connected device
As a public repository, a GitHub account is not required but it is recommended

The purpose of this website is to serve as my third Code Review for Epicodus.

Goal

Create a webpage that gathers a value from a user. When submitted, the webpage will return to the user a list of all values from 0 through whatever number they have submitted.
Certain values will be changed to either a word or a phrase. More specificially, values containing a 1 will be changes to "Beep!", values containing a 2 will be changed to "Boop!", and values containing a 3 will be changed to "Won't you be my neighbor". If a user, for example, were to enter '10', they would get the following returned to them:
"0, Beep!, Boop!, Won't you be my neighbor?, 4, 5, 6, 7, 8, 9, Beep!"
Next, we need to identify a heirarchy of these values. The conversion of 1 to "Beep!" is the least important, 2 to "Boop!" is the second most important, and 3 to "Won't you be my neighbor", So, for instance, if a user entered "13" the return would be "...8, 9, Beep!, Beep!, Boop!, Won't you be my neighbor". In other words, the conversion of a 1 digit is negated by the presence of a 2, and the conversion of a 2 is negated by the presence of a 3.

It is my opinion that the difficulty of these functions in order of simplest to most difficut is:

Known Bugs

11/18
- The javascript that is written will not work, but I feel is a step in the right direction.

11/20
- The original script was abandoned (for now) and a new direction is being pursued, this new script is still receiving errors in the console log
- The HTML is far from finished

Hans J Schroeder 2021