When determining the efficiency of an algorithm How would you measure the space?

Put simply, algorithms are a way of solving a class of problems. They are a ‘finite sequence’ made to work with any programming language. Think of these as instructions, just like a recipe! It includes step-by-step directions that can be applied to return the desired result. Since all programming languages, share some commonalities such as loops and conditional statements, we can apply these to any programming language.

Working is Not Good Enough

It’s not okay to assume that your algorithm is acceptable, just because it’s working. That’s only one part of the problem-solving process. It’s best practice for programmers to refactor their work. We must question the efficiency of our methods. Remember, there is more than one route we can take to get to our final destination.

Units of Measurement

We can grade our program’s efficiency based on total complexity, which is made up of approximate time and space measurements. This concept is referred to as Big O Notation. If you’re unfamiliar with this idea, stick with me here. We’re not building a flux capacitor here! I’m going to introduce you to how Big O Notation is formalized.

Time Complexity

Time complexity represents the time required by the algorithm to run to completion. Many algorithms are so fast that we can’t use a timer for accurate results, even if we use the same machine for counting time.
Instead, we can use this formula below to determine time complexity.
T(n) = c * n
N represents the input we are working with and C represents time taken.

Scaling from Best to Worst

The result of time complexity is generally defined as constant, logarithmic, linear, N-log-N, quadratic, cubic, or exponential. As you can see in the chart below, measurement is given as O(n). N still representing the input that we are working with. These are listed in order of efficiency. Constant time is ideal because it takes the same number of operations no matter what N is. Exponential time is practically our worst nightmare, because it grows very quickly and will cause our program to respond at a snail’s pace.

Things to Keep in Mind

Integers and small terms don’t get counted when calculating complexity. Arithmetic operations, variable assignments and accessing elements in an array are also considered constants and do not change the result. When you’re working with a block of code that contains a loop, the complexity is measure for the length of the loop. If there is another loop inside that loop, it’s considered quadratic.

Space Complexity

Space complexity is the total amount of memory used by a program, including the space of input values during execution. In order to figure out the space complexity, we can calculate the space occupied by the variables used in an algorithm. A program with terrible time efficiency will run much slower than we want, but a program with terrible space efficiency might not run at all. The question to ask when determining space complexity is, does this variable scale with the size of our input? (Typically, integers don’t matter here as they take up the same amount of space.) The ideal space complexity is also constant which means the space taken does not change with the input given.

Conclusion

Learning Big O Notation takes time and practice. However, this is a smart investment as it helps us to understand what makes a great program. We can recognize where we have room for growth and work towards it. Being able to create effective algorithms flexes our problem-solving muscles. It gives us a way to grade our work and revisit the drawing board to make it even better than before. I hope that this has sparked your curiosity to dive deeper into this topic. Check out the resources below for more on calculating complexities.

📌   A data structure where elements can be added or removed at either end but not in the middle

📌   Which of the following name does not relate to stacks?

📌   The complexity of merge sort algorithm is

📌   The complexity of linear search algorithm is

📌   When determining the efficiency of algorithm, the space factor is measured by

📌   Each array declaration need not give, implicitly or explicitly, the information about

📌   The Average case occur in linear search algorithm

📌   The term “push” and “pop” is related to the

📌   Which of the following case does not exist in complexity theory

📌   The difference between linear array and a record is

📌   For an algorithm the complexity of the average case is

📌   When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

📌   The memory address of fifth element of an array can be calculated by the formula

📌   The operation of processing each element in the list is known as

📌   Which of the following statement is false?

📌   Finding the location of the element with a given value is:

📌   Which of the following is not a limitation of binary search algorithm?

📌   The memory address of the first element of an array is called

📌   The elements of an array are stored successively in memory cells because

📌   Which of the following data structure is not linear data structure?

📌   If the values of a variable in one module is indirectly changed by another module, this situation is called

When determining the efficiency of an algorithm the space is measured by?

What are the measures to measure the efficiency of an algorithm?