http://www.conceptdraw.com/

# Month: September 2016

## What is advantage of state diagram ? Draw state diagram for ATM system.

http://www.conceptdraw.com/

## What is advantage of state diagram ? Draw state diagram for ATM system.

http://www.conceptdraw.com/

## Verify the expression n! = O(n^n)

## Verify the expression n! = O(n^n)

Verify the expression n! = O(n^n)

## Verify the expression n! = O(n^n)

Verify the expression n! = O(n^n)

## Determine the complexity of following sorting algorithms > Heap Sort

Heap ComplexityThe part just shown very similar to removal from a heap which is O(log(n)). You do it n-1 times so it is O(nlog(n)). The last steps are cheaper but for the reverse reason from the building of the heap, most are log(n) so it is O(nlog(n)) overall for this part. The build part was…

## Determine the complexity of following sorting algorithms > Heap Sort

Heap Complexity The part just shown very similar to removal from a heap which is O(log(n)). You do it n-1 times so it is O(nlog(n)). The last steps are cheaper but for the reverse reason from the building of the heap, most are log(n) so it is O(nlog(n)) overall for this part. The build part…

## Determine the complexity of following sorting algorithms > Heap Sort

Heap ComplexityThe part just shown very similar to removal from a heap which is O(log(n)). You do it n-1 times so it is O(nlog(n)). The last steps are cheaper but for the reverse reason from the building of the heap, most are log(n) so it is O(nlog(n)) overall for this part. The build part was…

## Determine the complexity of following sorting algorithms > Bubble Sorting

Complexity Analysis of Bubble SortingIn Bubble Sort, n-1 comparisons will be done in 1st pass, n-2 in 2nd pass, n-3 in 3rd pass and so on. So the total number of comparisons will be(n-1)+(n-2)+(n-3)+…..+3+2+1Sum = n(n-1)/2i.e O(n2)Hence the complexity of Bubble Sort is O(n2).The main advantage of Bubble Sort is the simplicity of the algorithm.Space…