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

Ask an Expert

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

Write your message here..

Related Questions

The data structure required to evaluate a postfix expression, The data stru... The data structure needed to evaluate a postfix expression is  Stack

Stack making use of the linked list, Q. Implement a stack making use of the... Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include

Creation of doubly linked list, Program: Creation of Doubly Linked List ... Program: Creation of Doubly Linked List OUTPUT Input the values of the element -1111 to come out : 1 Input the values of the element -1111 to come out : 2 Inpu

Test whether a binary tree is a binary search tree, Q. Write down an algori... Q. Write down an algorithm to test whether a Binary Tree is a Binary Search Tree.              A n s . The algorithm to check whether a Binary tree is as Binary Search

Methods, what is folding method? what is folding method?

Types of triangular matrices, Triangular Matrices Tiangular Matrices is... Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular

Simplifying assumptions of wire frame representation, Simplifying Assumptio... Simplifying Assumptions of wire frame representation Neglect colour - consider Intensity: For now we shall forget about colour and restrict our discussion just to the intensi

Find longest repeat prefix of string - linear time algorithm, 1. A string s... 1. A string s is said to be periodic with a period α, if s is α k for some k > 2. (Note that α k is the string formed by concatenating k times.) A DNA sequence s is called a tand

Depth First Search Through Un-weighted Connected Graph , Q. Write down the ... Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

Binary tree and binarytree parts, Q. What do you understand by the term Bin... Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to