What is called the basic operation of an algorithm, Data Structure & Algorithms

What is called the basic operation of an algorithm?

The most significant operation of the algorithm is the operation contributing the most to the total running time is known as basic operation of an algorithm.

 

Posted Date: 7/27/2013 5:30:34 AM | Location : United States







Related Discussions:- What is called the basic operation of an algorithm, Assignment Help, Ask Question on What is called the basic operation of an algorithm, Get Answer, Expert's Help, What is called the basic operation of an algorithm Discussions

Write discussion on What is called the basic operation of an algorithm
Your posts are moderated
Related Questions
What is the best-case number of comparisons performed by mergesort on an input sequence of 2 k distinct numbers?

Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed

Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.

red black tree construction for 4,5,6,7,8,9

The process of accessing data stored in a serial access memory is same to manipulating data on a By using stack  method.

Time Complexity:- The time complexity of an algorithm is the amount of time it requires to run to completion. Some of the reasons for studying time complexity are:- We may be in

discuss the operating system under the following: MONOLITHIC SYSTEM,LAYER SYSTEM AND VIRTUAL MACHINES

A town contains a total of 5000 houses. Every house owner has to pay tax based on value of the house. Houses over $200 000 pay 2% of their value in tax, houses over $100 000 pay 1.

Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.

Q. Explain the result of inserting the keys given. F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E  in an order to an empty B-tree of degree-3.