• Creating a local clone of Mysql Database

    Swapnil
    No Comments

    Times when you want to work with the local copy of the website or application you might want to take the real database and replicate it to provide you with a local copy of the live mysql database. To do this just execute the following command  mysqldump -h [server] -u [user] ‘-p[password]‘ db1 | mysql […]

    Read More
  • Overloading in PHP with Example

    Swapnil
    No Comments

    Function overloading or method overloading is a feature that allows creating several methods with the same name which differ from each other in the type of the input parameters. It is simply defined as the ability of one function to perform different tasks. For example, doTask() and doTask(object O) are overloaded methods. To call the […]

    Read More
  • Simplest chat example in node.js and socket io

    Swapnil
    No Comments

    Simplest Chat Server in Node.js implemented with socket.io I’ll directly start since you guys don’t need introduction to node.js.I would like to comment on the feature exposed in this example of Nodejs and power of javascript running in both client and server side, it can use the event emitters  - event production and consumption design pattern […]

    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
  • Functions In PHP

    Swapnil
    No Comments

    Functions in PHP   In this example, PHP codes are embedded in HTML. Here, we have used a function ‘DisplayTitle()’. This function starts with the word function and indicates that the character inserted just after this word is a function. It displays  the title of the tutorial. Any one who will go through this will […]

    Read More

Search

Powered by Ajaxy