Avinash Singh Rathore

 Program Complexity

                                     Worst                                   average                                      Best

Insertion                        O(n2)                                     O(n2)                                         O(n)

Selection                        O(n2)                                     O(n2)                                         O(n2)

Quick                             O(n2)                              O(nlog(n))                                   O(nlog(n))

Merge                            O(nlog(n))                        O(nlog(n))                                    O(nlog(n))

Heap                             O(nlog(n))                         O(nlog(n))                                    O(nlog(n))

Binary                           O(log(n))                            O(log(n))                                          O(1)