merge sort Archives

79 views
1 minute read
No comments

Merge Sort for Doubly Linked List

Venkatesan Prabu
October 15, 2017

C Programming-Merge Sort for Doubly Linked List – Searching and Sorting – Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists

View Post

Merge Sort for Doubly Linked List

Venkatesan Prabu
October 15, 2017
16 shares

16

0

0

JAVA Programming-Merge Sort for Doubly Linked List – Searching and Sorting – Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists.

View Post

163 views
1 minute read
No comments

Insertion Sort for Singly Linked List

Venkatesan Prabu
October 15, 2017
1 share

1

0

0

Insertion Sort for Singly Linked List – Searching and sorting – We have discussed Insertion Sort for arrays.In this article linked list is also discussed.

View Post

QuickSort on Singly Linked List

Venkatesan Prabu
October 15, 2017

QuickSort on Singly Linked List – Searching and sorting – Quick Sort on Doubly Linked List is discussed here.In Singly linked list was given as an exercise. Following is C++ implementation for same.

View Post

Merge Sort for Linked Lists

Venkatesan Prabu
October 15, 2017
1 share

1

0

0

Merge Sort for Linked Lists – Searching and Sorting – Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible.

View Post

Which sorting algorithm makes minimum number of memory writes?

Venkatesan Prabu
October 15, 2017

Which sorting algorithm makes minimum number of memory writes – Searching and Sorting – Minimizing the number of writes is useful when making writes to some huge data set is very expensive, such as with EEPROMs or Flash memory, where each write reduces the lifespan of the memory.

View Post

Comb Sort

Venkatesan Prabu
October 15, 2017
1 share

1

0

0

Comb Sort – Searching and Sorting – Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed one by one. Comb Sort improves on Bubble Sort by using gap of size more than 1.

View Post

ShellSort

Venkatesan Prabu
October 15, 2017

ShellSort – Searching and Sorting – ShellSort is mainly a variation of Insertion Sort. In insertion sort, we move elements only one position ahead. When an element has to be moved far ahead, many movements are involved.

View Post

57 views
2 minute read
No comments

Bucket Sort

Venkatesan Prabu
October 15, 2017
1 share

1

0

0

Bucket Sort – Searching and sorting – A simple way is to apply a comparison based sorting algorithm. The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc) is Ω(n Log n), i.e., they cannot do better than nLogn.

View Post

34 views
2 minute read
No comments

Counting Sort

Venkatesan Prabu
October 15, 2017

Counting sort – Searching and Sorting – Counting Sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing).

View Post

merge sort

Merge Sort for Doubly Linked List

QuickSort on Singly Linked List

Comb Sort

ShellSort

Bucket Sort

Counting Sort

WIKITECHY

WORKSHOP

JOIN OUR COMMUNITY

OTHER LANGUAGES