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
Chaining In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element havi

Q. How do we represent a max-heap sequentially? Explain by taking a valid   example.         Ans: A max heap is also called as a descending heap, of size n is an almos

This notation gives an upper bound for a function to within a constant factor. Given Figure illustrates the plot of f(n) = O(g(n)) depend on big O notation. We write f(n) = O(g(n))

Q. Write down an algorithm to insert a node in the beginning of the linked list.                         Ans: /* structure containing a link part and link part

using a program flowchart design a program to illustrate pop and push operation

Q. Take an array A[20, 10] of your own. Suppose 4 words per memory cell and the base address of array A is 100. Find the address of A[11, 5] supposed row major storage.

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

how we can convert a graph into tree

In this unit, the following four advanced data structures have been practically emphasized. These may be considered as alternative to a height balanced tree, i.e., AVL tree.

algorithm for insertion in a queue using pointers