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
Example 1:  Following are Simple sequence of statements Statement 1;  Statement 2; ... ... Statement k; The entire time can be found out through adding the times for

Circular Queues:- A more efficient queue representation is get by regarding the array Q(1:n) as circular. It becomes more convenient to declare the array as Q(O: n-1), when  re

An AVL tree is a binary search tree that has the given properties: The sub-tree of each of the node differs in height through at most one. Each sub tree will be an AVL tre

Algorithm for insertion of any element into the circular queue: Step-1: If "rear" of the queue is pointing at the last position then go to step-2 or else Step-3 Step-2: make

Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

Illustrate Trivariate Colour Models Conventional colour models based on the tristimulus theory all contain three variables and so are called trivariate models. Let us now consi

Given the following search tree, state the order in which the nodes will be searched for breadth first, depth first, hill climbing and best first search, until a solution is reache

A linked list can be of the following types:-  Linear linked list or one way list Doubly linked list or two way list. Circular linked list Header linked list

DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper through visiting unvisite