best case, worst case and average case,, Data Structure & Algorithms

for i=1 to n
if a[i}>7
for j=2 to n
a[j]=a{j}+j
for n=2 to n
a[k]=a[j]+i
else if a[1]>4 && a[1] <=7
for 2 to a[1]
a[j]= a{j]+5
else
for 2to n
a[j]=a[j]+i
..
Posted Date: 11/1/2013 2:44:06 PM | Location : Jordan







Related Discussions:- best case, worst case and average case,, Assignment Help, Ask Question on best case, worst case and average case,, Get Answer, Expert's Help, best case, worst case and average case, Discussions

Write discussion on best case, worst case and average case,
Your posts are moderated
Related Questions
For the following graph find the adjacency matrix and adjacency list representation of the graph.

Algo rithm to Insert a Node p at the End of a Linked List is explained below Step1:   [check for space] If new1= NULL output "OVERFLOW" And exit Step2:   [Allocate fr

Hi, can you give me a quote for an E-R diagram

Q. Construct a binary tree whose nodes in inorder and preorder are written as follows: Inorder : 10, 15, 17, 18, 20, 25, 30, 35, 38, 40, 50 Preorder: 20, 15, 10

the above title please send give for the pdf file and word file


How do you rotate a Binary Tree?  Rotations in the tree: If after inserting a node in a Binary search tree, the balancing factor (height of left subtree - height of right

What is quick sort?   Answer Quick sort is one of the fastest sorting algorithm used for sorting a list. A pivot point is chosen. Remaining elements are divided or portio

Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?

Midsquare Method :- this operates in 2 steps. In the first step the square of the key value K is taken. In the 2nd step, the hash value is obtained by deleting digits from ends of