Saturday, April 2, 2011
Friday, April 1, 2011
Abstract Data Types
If you want to learn about Abstract Data Types the following PPT is enough. To go this plz...click here
This is the brief detailed hard copy now in as soft copy for above PPT. To go to this plz...click here
Friday, March 25, 2011
Thursday, March 10, 2011
Wednesday, March 9, 2011
Software Testing Tools
If you want Full tutorial for Software Testing click hereSoftware Testing
If you want techniques for Software Testing click hereSoft Techniques
GITAM UNIVERSITY
Friday, November 12, 2010
Saturday, October 23, 2010
Saturday, September 25, 2010
Wednesday, September 22, 2010
Project Report Format
Check out this SlideShare Presentation:
Project Report Format
View more presentations from Vikramkumar B. Thadeshvar.
Monday, September 20, 2010
Wednesday, September 8, 2010
Friday, September 3, 2010
Saturday, August 21, 2010
Tuesday, August 10, 2010
Sunday, August 8, 2010
Saturday, August 7, 2010
Saturday, July 24, 2010
QUICK SORT TECHNIQUE WITH LIST OF ELEMENTS
Full example of quicksort on a random set of numbers. The boxed element is the pivot. It is always chosen as the last element of the partition. However, always choosing the last element in the partition as the pivot in this way results in poor performance (O(n2)) on already sorted lists, or lists of identical elements. Since sub-lists of sorted / identical elements crop up a lot towards the end of a sorting procedure on a large set, versions of the quicksort algorithm which choose the pivot as the middle element run much more quickly than the algorithm described in this diagram on large sets of numbers.
QUICK SORT TECHNIQUE WITH DIAGRAM
| Visualization of the quicksort algorithm. The horizontal lines are pivot values. | |
| Class | Sorting algorithm |
|---|---|
| Worst case performance |  |
| Best case performance |  |
| Average case performance | |
| Worst case space complexity |  |
Subscribe to:
Posts (Atom)