Sort a linked list using bubble sort

 Posted on January 19, 2014  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

Merge sort looks like a best choice for sorting the linked list.At a first appearance, merge sort may be a good selection since the middle element is required to subdivide the given list into 2 halves, but we can easily solve this problem by moving the nodes alternatively to 2 lists. We have discussed the sorting options for linked list here. Here we will discuss about bubble sort Pseudocode for bubble sort: [Read More]
bubble sort  kodeknight  sorting  linked list 

Bubble sort on double linked list

 Posted on January 19, 2014  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

 Following can be the pseudocode:

public void bubbleSort() {  
    boolean done = false;  
    while (!done) {  
        Node cur = head;  
        done = true;  
        while(cur != tail) {  
            if (cur.getNext().getCount()>cur.getCount()) {  
                swap(cur.getNext(),cur);  
                done=false;  
            }  
            cur = cur.getNext();  
        }  
    }  
}

Thanks.
Source : stackoverflow

bubble sort  kodeknight  sorting  Doubly Linked List  DLL 

What's the fastest algorithm for sorting a linked list?

 Posted on January 19, 2014  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Merge sort is the best choice. At a first appearance, merge sort may be a good selection since the middle element is required to subdivide the given list into 2 halves, but we can easily solve this problem by moving the nodes alternatively to 2 lists. It is reasonable to expect that you cannot do any better than O(N log N) in running time, whenever we use comparison based sorts. [Read More]
bubble sort  kodeknight  merge  quicksort  sorting  linked list  Selection Sort  merge-sort  insertion-sort 

Bubble sort

 Posted on January 14, 2010  (Last modified on August 7, 2020)  |  4 minutes  |  Kinshuk Chandra

The sorting problem Input: Array of numbers , unsorted. Eg. Output : Same numbers sorted in some order, say increasing order. Eg. What is Bubble Sort? The bubble sort works by comparing each item in the list with the item next to it, and swapping them if required. The algorithm repeats this process until it makes a pass all the way through the list without swapping any items (in other words, all items are in the correct order). [Read More]
cpp  kodeknight  Data Structures  DS  c  array  Sorting Algorithm  bubble sort  sorting arrays  programming  sorting  incomplete  programCPP  Data Structure  java