while(alive) {eat(); sleep(); code(); repeat(); } Stay Consistent and Code

 Hey there, Arin here  Happy Coding, In this Blog we'll Discuss about Big-O notations in Coding/Programming, Don't get intimidated it's really very easy to understand and implement, What is Big-O Notation? The Big O notation is used to express the upper bound of the runtime of an algorithm and thus measure the worst-case time complexity of an algorithm.  Now this is the standard definition given but shortly,  It analyses and calculates the time and amount of memory required for the execution of an algorithm for an input value. Basically it's like a system which checks the performance of any piece of code/program. There are different types of Big O notations Big O: “f(n) is O(g(n))” if for some constants c and N₀, f(N) ≤ cg(N) for all N > N₀ Omega: “f(n) is Ω(g(n))” if for some constants c and N₀, f(N) ≥ cg(N) for all N > N₀ Theta: “f(n) is Θ(g(n))” if f(n) is O(g(n)) and f(n) is Ω(g(n)) Little O: “f(n) is o(g(n))” if f(n) is O(g(n)) and f(n) is not Θ(g(n)...

 Hey There, Arin here  Happy Coding,  Now, Before diving into things about data structures algos and etc etc..., lets understand... What are these Data Structures? It can be easily defined as different ways of Organizing Data om your Computer. Also remember, that efficiency of any program depends on the storage of the data, the data must be organised and stored in the most efficient way. Example: Movie Ticket - to buy a ticket you would have to stand in a queue , which is also a kind of data structure in Computer Science. There are a few Sub-divisions of Data Structure which we'll be discussing in later on blogs: What are Algorithms? Set of instructions to perform a task or solving a problem. There are many types of Algorithms : Recursive Algorithm Divide and Conquer Algorithm Dynamic Programming Algorithm Greedy Algorithm Brute Force Algorithm Backtracking Algorithm For now, this much Introduction is Sufficient we'll get to each of the topic with time.