Compare two functions, Data Structure & Algorithms

Compare two functions n2   and 2n /for distinct values of n.   Determine


When second function becomes larger than first function.

 

 

N

n2

2n/4

1

2

3

4

5

6

7

8

9

10

1

4

9

16

25

36

49

64

81

100

0.5

1

2

4

8

16

32

64

128

256

 

When n=8, then the value of n2  and 2n/4 is same. Before that n2  >2n/4, and after this value n2< 2n/4.

Posted Date: 7/9/2012 9:52:43 PM | Location : United States







Related Discussions:- Compare two functions, Assignment Help, Ask Question on Compare two functions, Get Answer, Expert's Help, Compare two functions Discussions

Write discussion on Compare two functions
Your posts are moderated
Related Questions
Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front

Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

ST AC K is explained as follows : A stack is one of the most usually used data structure. A stack is also called a Last-In-First-Out (LIFO) system, is a linear list in

As part of an experiment, a school measured heights (in metres) of all its 500 students. Write an algorithm, using a flowchart that inputs the heights of all 500 students and ou

Q. By giving an example show how multidimensional array can be represented in one the dimensional array.

(i)  Consider a system using flooding with hop counter. Suppose that the hop counter is originally set to the "diameter" (number of hops in the longest path without traversing any

WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO POSTFIX FORM ALSO TRACE ALG ON ((A+B)*C-(D-E)$F+G)

1.Create a flowchart to show the process that will allow the implementation of Stack, Push, and Pop operations. 2.Create a flowchart to show the process that will allow the impleme

Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val

Time Complexity, Big O notation The amount of time needed by an algorithm to run to its completion is referred as time complexity. The asymptotic running time of an algorithm i