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
Range: A Structured Type in Ruby Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss rang

Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

Q. Which sorting algorithm can be easily adaptable for singly linked lists? Explain your answer as well.        Ans: The simple Insertion sort is sim

write a algorithsm in c to perform push and pop operations stastic implementation using array ?

A binary search tree is constructed through the repeated insertion of new nodes in a binary tree structure. Insertion has to maintain the order of the tree. The value to the lef

Program Insertion of a node into any Circular Linked List Figure depicts a Circular linked list from which an element was deleted. ALGORITHM (Deletion of an element from a

A shop sells books, maps and magazines. Every item is identified by a unique 4 - digit code. All books have a code starting with a 1, all maps have a code which starts with a 2 and

Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

H o w can you r ot a t e a B i n a r y Tr e e? E x pl a i n r i g h t a n d l eft r ot a tion s by taking an e x a mpl e.   If after

Write down the algorithm of quick sort. An algorithm for quick sort: void quicksort ( int a[ ], int lower, int upper ) {  int i ;  if ( upper > lower ) {   i = split ( a,