Question

Which operations are considered as
Book Keeping Operations while
calculating Time Complexity?!​

Answer 1

Answer:

For any defined problem, there can be N number of solution. This is true in general. If I have a problem and I discuss about the problem with all of my friends, they will all suggest me different solutions. And I am the one who has to decide which solution is the best based on the circumstances.

Similarly for any problem which must be solved using a program, there can be infinite number of solutions. Let's take a simple example to understand this. Below we have two different algorithms to find square of a number(for some time, forget that square of any number n is n*n):

One solution to this problem can be, running a loop for n times, starting with the number n and adding n to it, every time.

/*  

   we have to calculate the square of n

*/

for i=1 to n

   do n = n + n

// when the loop ends n will hold its square

return n

Or, we can simply use a mathematical operator * to find the square.

/*  

   we have to calculate the square of n

*/

return n*n

In the above two simple algorithms, you saw how a single problem can have many solutions. While the first solution required a loop which will execute for n number of times, the second solution used a mathematical operator * to return the result in one line. So which one is the better approach, of course the second one.

Step-by-step explanation:

make me brainlist!!