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
Q. Sort the sequence written below of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55                                                                      Ans:

State the Introduction to pseudocode No specific programming language is referred to; development of algorithms by using pseudocode uses generic descriptions of branching, loop

Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti

what is hashing? what are diffrent method of hashing?

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

Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Qu

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 (Ti

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] for 2 to a[1] a[j]= a{j]+5 else for 2to n a[j]=a[j]+i ..

In the last section, we discussed regarding shortest path algorithm that starts with a single source and determines shortest path to all vertices in the graph. In this section, we

Build a class ?Node?. It should have a ?value? that it stores and also links to its parent and children (if they exist). Build getters and setters for it (e.g. parent node, child n