Recursion is probably the most tricky concept among not only programming newbies but also professionals. Causing a lot of troubles for programmers whentrying to understand it. Recursion, however is used in more advanced concepts of the programming, like many algorithms,… Read More »What is Recursion in programming – the ultimate explaination
What is a data structure? To answer this question, the best will be to use some trivial analogy. Tissues in packages are stacked on top of each other, books in libraries side by side. In addition (books), they are usually… Read More »What is a Data Structure in programming?
What is an algorithm – this may sound like a silly question, but there are many definitions of algorithms on the Internet. In previous articles Patryk wrote about the time and space complexities of algorithms, so it would be appropriate… Read More »What is an Algorithm – Everything You Need To Know
Space complexity, as I mentioned in this article, is the total space needed to execute an algorithm. We use memory to store some data. The main part of memory consumption in algorithms comes from the use of variables. In simple… Read More »Space complexity of algorithms
What is Big O Notation? Big O notation is a way to determine the complexity of an algorithm. Using Big O notation we assume the ratio of time or memory needed to execute some algorithm on a certain amount of… Read More »Big O Notation and Time complexity of algorithms