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 a Binary Search Tree (BST)? A binary search tree B is a binary tree every node of which satisfies the three conditions: 1.  The value of the left-subtree of 'x' is le

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as

Program segment for the deletion of any element from the queue delmq(i)  /* Delete any element from queue i */ { int i,x; if ( front[i] == rear[i]) printf("Queue is

The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

Determine the greatest common divisor (GCD) of two integers, m & n. The algorithm for GCD might be defined as follows: While m is greater than zero: If n is greater than m, s

Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord

Example: (Single rotation into AVL tree, while a new node is inserted into the AVL tree (LL Rotation)) Figure: LL Rotation The rectangles marked A, B & C are trees

Searching is the procedure of looking for something. Searching a list containing 100000 elements is not the similar as searching a list containing 10 elements. We discussed two sea

Q. Compare and contrast various sorting techniques or methods with respect to the memory space and the computing time.