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
hello, i need help in data mining assignment using sas em and crisp-dm

Z-Buffer Algorithm Also known as the Depth-Buffer algorithm, this image-space method simply selects for  display the polygon or portion of a polygon that is nearest to the view

Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.

Define Big Theta notation Big Theta notation (θ) : The upper and lower bound for the function 'f' is given by the big oh notation (θ). Considering 'g' to be a function from t

Write an algorithm in form of a flowchart that takes temperatures input over a 100 day period (once per day) and outputs the number of days when temperature was below 20C and numbe

Which sorting algorithm is easily adaptable to singly linked lists? Simple Insertion sor t is easily adabtable to singly linked list.

Define about the inheritance hierarchy Languages Eiffel and D provide constructs in language for invariants and pre- and post conditions which are compiled into the code and ar

What is a first-in-first-out data structure ? Write algorithms to perform the following operations on it – create, insertion, deletion, for testing overflow and empty conditions.

This algorithm inputs 3 numbers, every number goes through successive division by 10 until its value is less than 1. An output is produced which comprise the number input and a val

Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n