Higher Order Functions

Hmmm, this is a rather unusual topic to talk about in a blog :] but I'm gonna try talking about it for short while.
I think that using these functions with arrays can save you up a lot of time since you can chain them together to produce any desired output. In the beginning, anonymous functions were scary to me. I still remember dealing with them using the language Java and especially lately with android mobile development. We used these anonymous functions to override a function without creating a new class from scratch just to make it fast and avoid repeating unnecessary code.
Why am I talking about anonymous functions? well, because usually we have used our implementation of these functions(higher order ones) and wrote them with the help of anonymous functions. We don't need to repeat ourselves anymore with the map function for example, and the same goes for filter and reduce as well. Except that we still didn't touch upon these two functions yet.
So, till next time I'm gonna stop here and continue later.

:)

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...

Relational Databases

Relational databases are, well... a collection of data items that have relations between them. These relations are made by associating a one table's primary key with another table's foreign key. It is a great advancement from the old long table that was used to store data which was inefficient in terms of search, memory and space. And as for normalization; it means a process in which tables are structured to eliminate redundancy and repetition among data and the CRUD operations side-effects. And as a direct result we improve the performance of our queries. An example of a relational database would be two tables; one for student and the other for school. Both of these tables have a column for the school id, and so we make a connection between by assigning the first one as a primary key and the other as foreign key.

Greenfield Project

This is a project where me and other three people joined forces to build it together. It started with meeting each other on the first day to decide on the project idea. After a couple hours of brainstorming we finally decided on a particular thing to do; and it was a web app to help manage a school system. This app was aimed at teachers, parents and students, in addition to admins moderating the system. We started big and worked our way through the waffle tasks but got overwhelmed along the way since it was a very big project for both our limited time and our team members' technical abilities. We faced many difficulties while working on this project; especially setting up mysql and getting it to work on all of our team members' machines. We switched to setting it up locally because the website we used to host our database kept showing an error of too many users so we kept testing locally until we hosted it online on a different website before the end of the time period. We work...

colorfulMinds

Search This Blog