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
write an algorithm for multiplication of two sparse matrices using Linked Lists

Q. Define a method for keeping two stacks within a single linear array S in such a way that neither stack overflows until entire array is used and a whole stack is never shifted to

Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

Define Strictly Binary Tree Strictly Binary Tree: - If each non leaf node in binary tree has non empty left and right sub-trees , then the tree is known as a strictly binary t

Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

What is quick sort? Quick sort is a sorting algorithm that uses the idea if split and conquer. This algorithm chooses an element called as pivot element; search its position in

In assignment, you have already started the process of designing a database for the Beauty Salon mini-case (enclosed again below), mainly in the phase of conceptual database design

A stack is a last in, first out (LIFO) abstract data type and sequential data structure. A stack may have any abstract data type as a component, but is characterized by two fundame