Process of analysis, Data Structure & Algorithms

The objective analysis of an algorithm is to determine its efficiency. Efficiency is based on the resources which are used by the algorithm. For instance,

  • CPU utilization (Time complexity)
  • Memory utilization (Space complexity)
  • Disk usage (I/O)
  • Network usage (bandwidth).

There are two significant attributes to analyze an algorithm. They are given:

Performance: How much /memory/disk/network/ time bandwidth is actually utilized when a program is run. This based on the machine, algorithm, compiler, etc.

Posted Date: 4/4/2013 5:47:30 AM | Location : United States







Related Discussions:- Process of analysis, Assignment Help, Ask Question on Process of analysis, Get Answer, Expert's Help, Process of analysis Discussions

Write discussion on Process of analysis
Your posts are moderated
Related Questions

Describe an algorithm to play the Game of Nim using all of the three tools (pseudocode, flowchart, hierarchy chart)

An unsorted array is searched through linear search that scans the array elements one by one until the wanted element is found. The cause for sorting an array is that we search

Determination of Time Complexity The RAM Model The random access model (RAM) of computation was devised through John von Neumann to study algorithms. In computer science,

Example of pre order traversal: Reading of a book, since we do not read next chapter unless we complete all sections of previous chapter & all its sections. Figure  : Rea

Red-Black trees have introduced a new property in the binary search tree that means an extra property of color (red, black). However, as these trees grow, in their operations such

This is a unit of which targeted on the emerging data structures. Red- Black trees, Splay trees, AA-trees & Treaps are introduced. The learner must explore the possibilities of app

Question 1 Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps. Question 2

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 time needed to delete a node x from a doubly linked list having n nodes is O (1)