Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
The complexity Ladder:
In computer science, Exponential growth is the most-danger growth pattern. Algorithms which grow this way are fundamentally useless for anything except for very small input size.
Table 1 compares several algorithms in terms of their complexities.
Table 2 compares the typical running time of algorithms of distinct orders.
The growth patterns above have been tabulated in order of enhancing size. That is,
O(1) < O(log(n)) < O(n log(n)) < O(n2) < O(n3), ... , O(2n).
Notation
Name
Example
O(1)
Constant
Constant growth. Does
not grow as a function
of n. For example, accessing array for one element A[i]
O(log n)
Logarithmic
Binary search
O(n)
Linear
Looping over n
elements, of an array of size n (normally).
O(n log n)
Sometimes called
"linearithmic"
Merge sort
O(n2)
Quadratic
Worst time case for
insertion sort, matrix multiplication
O(nc)
Polynomial,
sometimes
O(cn)
Exponential
O(n!)
Factorial
Table 1: Comparison of several algorithms & their complexities
Array size
Logarithmic:
log2N
Linear: N
Quadratic: N2
Exponential:
2N
8
128
256
1000
100,000
3
7
10
17
64
16,384
65,536
1 million
10 billion
3.4*1038
1.15*1077
1.07*10301
........
Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed
Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.
how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?
Q. Write down any four applications or implementation of the stack. Ans. (i) The Conversion of infix to postfix form (ii)
Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31
Triangular Matrices Tiangular Matrices is of 2 types: a) Lower triangular b) Upper triangular
How sparse matrix stored in the memory of a computer?
AVL trees are applied into the given situations: There are few insertion & deletion operations Short search time is required Input data is sorted or nearly sorted
Post-order Traversal This can be done both iteratively and recursively. The iterative solution would need a change of the in-order traversal algorithm.
Program gives the program segment by using arrays for the insertion of an element to a queue into the multiqueue. Program: Program segment for the insertion of any element to t
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd