Technology Blog

Worst Case Best Case and Average Case of Algortihms

2012-10-26T13:51:00.001+05:30

Over here we will have a look at algorithms and cases which are required for us to understand it. it is basically the performance of the algortihms kindly go through it

for further clarification u may go to wikipedia links given in this table

Name	Best	Average	Worst	Memory	Stable	Method	Other notes
Quicksort	20 !	20 !	25 !	05 !	Depends	Partitioning	Quicksort is usually done in place with O(log(n)) stack space.^{[citation needed]} Most implementations are unstable, as stable in-place partitioning is more complex. Naïve variants use an O(n) space array to store the partition.^{[citation needed]}
Merge sort	20 !	20 !	20 !	15 !Depends; worst case is	Yes	Merging	Highly parallelizable (up to O(log(n))) for processing large amounts of data.
Merge sort	50 !	50 !	23 !	00 !	Yes	Merging	Implemented in Standard Template Library (STL);^[2] can be implemented as a stable sort based on stable in-place merging.^[3]
Heapsort	20 !	20 !	20 !	00 !	No	Selection
Insertion sort	15 !	25 !	25 !	00 !	Yes	Insertion	O(n + d), where d is the number of inversions
Introsort	20 !	20 !	20 !	05 !	No	Partitioning & Selection	Used in SGI STL implementations
Selection sort	25 !	25 !	25 !	00 !	No	Selection	Stable with O(n) extra space, for example using lists.^[4] Used to sort this table in Safari or other Webkit web browser.^[5]
Timsort	15 !	20 !	20 !	15 !	Yes	Insertion & Merging	comparisons when the data is already sorted or reverse sorted.
Shell sort	15 !	23 ! or	23 !Depends on gap sequence; best known is	00 !	No	Insertion
Bubble sort	15 !	25 !	25 !	00 !	Yes	Exchanging	Tiny code size
Binary tree sort	15 !	20 !	20 !	15 !	Yes	Insertion	When using a self-balancing binary search tree
Cycle sort	50 !—	25 !	25 !	00 !	No	Insertion	In-place with theoretically optimal number of writes
Library sort	50 !—	20 !	25 !	15 !	Yes	Insertion
Patience sorting	50 !—	50 !—	20 !	15 !	No	Insertion & Selection	Finds all the longest increasing subsequences within O(n log n)
Smoothsort	15 !	20 !	20 !	00 !	No	Selection	An adaptive sort - comparisons when the data is already sorted, and 0 swaps.
Strand sort	15 !	25 !	25 !	15 !	Yes	Selection
Tournament sort	50 !—	20 !	20 !			Selection
Cocktail sort	15 !	25 !	25 !	00 !	Yes	Exchanging
Comb sort	15 !	15 !	25 !	00 !	No	Exchanging	Small code size
Gnome sort	15 !	25 !	25 !	00 !	Yes	Exchanging	Tiny code size
Bogosort	15 !	45 !	45 !	00 !	No	Luck	Randomly permute the array and check if sorted.
^[6]	50 !	20 !	20 !	00 !	Yes

Just go through the Algos in your Book or on wikipedia

Pure Object Oriented Language Java

2011-04-04T00:54:00.000+05:30

Java Programming is better then any other Programming Language coz its Support for OOp is better then any other Language the Point which says That Java dont support all the Concepts of JAVA is actually Made coz JAVA was meant by keeping in Mind that if that points are supported then this would make problems with the programs which makes use of this concepts as they would manipulate the law of encapsulation say operator overloading:
it can be used for other purpose without changing the basic meaning of the operator but this can hinder hte security of data as this operaotr can manipulate the classes in whichi they are made.
Complete Inheritance is not supported Specially Multiple inheritance but it can be achieved using simple without use of Interfaces. bocz the concept of inheritance says that u cna call objects of the Super class
so grandchild can also call grandfather if nothing is specified like private or protected

ava alxo helps us to make our concepts clear Like Overriding

Plus Primitive Data types have Wrapper classes which internally makes objects of each of the primitive data type so saying Java Supports Primitive data type means it is not an OOL would be unfair to JAVA.
Java Dont allow its objects to go out of its environment unless it is forced to do so which is biggest strength of java. so as per my View Java Is completely OOP language

Logic Development

2011-01-07T11:15:00.000+05:30

For Logic Development the most essential thing is flowchart to develop flowchart u need some flow chart components n those components are attached in a file below

this are the symbols with which u can develop a flowchart. it can show u how ur program will flow it also supports dry run which helps u in finding output. now suppose u r calling in a call center then they will ask for your name n company name n then pass to sales department if we want information on some products or something. if the issue is related to shipping then to shipping department. if the problem is not solved then the call is passed to the help desk. now we will see how this flow chart is made.

this flow chart shows how our call is passed when we call at customer care from our phones.

for queries post comments over here or mail me from mail option.

C Programming tips

2010-12-30T00:05:00.000+05:30

For C programmers who have just started please be sure to keep ur logics properly unless u are good at logic u cannot code your program properly.
any difficulty just post a reply over here soon u will have some programs on this blog