What the Hell am I doing?

My day started really bad with me being late. My alarm was set to ring for everyday of the week except for two days, but that wasn't the case when it didn't ring for this day(Saturday). The problem was when you want to set an alarm you have to set it manually for each day or you can simply select the days this alarm gonna be ringing. And here was the catch; I selected the wrong days ☺.
I should have selected all days except Friday, but instead I selected all but Friday and Saturday :/
I must have thought that the 'S' meant Saturday not Sunday, and that's why I woke up really late.
But I arrived at the medical city circle around 8:00AM so it was fine, unless I mention the fact that I have missed breakfast because of this little incident.

Source: Google Image results

Edit: 20/10/2018

Now after the immersive phase has started I still have the same number of alarms that ring around the same hour, but I am not going to be late with the transportation we're getting from RBK.
And I'm not going to be ever late again => we have a breakfast meal to wake up early for.

Comments

Big O Notation

Big O Notation is a mathematical expression that describes how much time an algorithm takes to run according to the size of it's inputs; mostly concerned about the worst case scenario. Types: 1- Constant Time O(1): On this order, regardless of the number of items, the iterations(time) are constant. Example: const getFirstItem = items => items[0]; getFirstITem([1, 2, 3, 4]); // 1 (one iteration) getFirstItem(['b', 'd', 'g']); // 'b' (one iteration) 2- Linear Time O(n): On this order, the worst case grows with the number of items. Example: Javascript's built in function indexOf, it loops over an array to find the correct index of the passed element. The worst case is looping over the whole array. [1, 2, 4, 9, 23, 12].indexOf(12); 3- Quadratic Time O(n ^ 2): For this order, the worst case time is the square of the number of inputs. It grows exponentially according to the number of inputs. Example: Using nested loo...

Middlewares

Middlewares in Javascript are functions that come in the middle of the request-response cycle. They have access to both the request and the response object as well as the next middleware function to be executed; usually called next(). Popular examples on middleware include: body-parser, cors, session, cookie-seesion and cookie-parser.

Stack vs. Queue

Stack is like a pile of books placed on top of each other. We can add new books to the top and can remove them from only the top because stacks are LIFO which means last-in, first-out. Queues on the other hand are the opposite, which is FIFO meaning first-in, first-out. So adding an element to the queue will be the same but removing will happen to the first element not the last one. An example of a queue would be the wait line in front of any kind of service we see around us like the bus station or the shops,....etc.

colorfulMinds

Search This Blog