• The javascript’s superiority

    Swapnil
    No Comments

    Prior to the nineteenth century where people in India spoke a variety of languages could express the feelings in an emphatic way could convey the understanding to one another.No doubt some languages had the power to express poetry beautifully that Ramayana based on the life of Ram was  written entirely in the poetic form with […]

    Read More
  • WordPress HTTP GET and POST returning 404

    Swapnil
    No Comments

    Strange WordPress was returning a 404 after submitting a form by HTTP Get or POST. The main reason for this issue is check that you are having a form field with name=”name”. Refer : http://wordpress.org/support/topic/404-pops-after-custom-form-submission-by-post

    Read More
  • Heap Sort Implementation example program in c

    Swapnil
    No Comments

    Heap sort is a very famous sorting technique relying on building heaps. It runs in O(nLogn).

     

    Read More
  • Insertion Sort Implementation

    Swapnil
    No Comments

    Insertion Sort is another sorting algorithm better than bubble sort or selection sort. Even if the complexity of insertion sort is O(n2) sorting on large data set is quite useful feature. The Insertion Sort algorithm has O(n) when the list is already sorted.

     

    Read More
  • Recursive Merge Sort Implementation

    Swapnil
    No Comments

    Known to many as the best sorting algorithm for worst case time complexity merge sort runs in O(nLogn) The recursive implementation is given below :

     

    Read More
  • Selection Sort Implementation

    Swapnil
    No Comments

    Selection sort is good as compared to bubble sort since it has fewer number of swaps. But the algorithm runs in same O(n2) and has a bad attribute that evenif the input array is sorted order the algorithm requires scanning the entire array.  

     

    Read More
  • Bubble Sort

    Swapnil
    No Comments

    Bubble Sort is the first sorting algorithm for any beginner. Bubble Sort runs in O(n2) time. The algorithm makes maximum number of comparisions which is n(n – 1)/2. The algorithm makes n(n-1)/2 swaps in worst case as the compared elements are swapped among themselves. The Code:

     

    Read More
  • What is Actual Software Architecture ?

    Swapnil
    No Comments

    I think laws or concepts they hardly change but algorithms and technology they change at the most rapid rate. People should focus on building a nice architecture more and more. A good architect will immediately find a flaw in the model else which will be noticed every now and then after start of next phase. […]

    Read More
  • lyrics of susangati sada ghado balak palak सुसंगती सदा घडो

    Swapnil
    12 Comments

    susangati sada ghado sujan vakya kaani pado. kalank maticha jhado vishay sarvatha naavado. sadanghrikamali dado muradita hatane ado. viyog ghadata rado man bhav charitri jado. na nischay kadhi dhalo kujanvighna badha jado. na nischay kadhi dhalo kujanvighna margi valo. swatattva hrudaya kalo durabhimaan sara galo punha na man he malo durit atmabodh jalo.   सुसंगती […]

    Read More
  • Reformation 2.0 !! Industry Training Mumbai PHP Dot Net MVC 3 JAVA

    Swapnil
    1 Comment

    When students encounter programming or technology in general it is a part of their curriculum, but the syllabus on the first hand is such that students pass it (with nice marks !) without actually writing or running a single LOC ! Now the point is who is to be blamed ? “THE STUDENTS !!!” WHY […]

    Read More

Search

Powered by Ajaxy