quick sort algorithm Archives

Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?

Venkatesan Prabu
October 15, 2017
4 shares

4

0

0

Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists? – Searching and Sorting – Quick Sort in its general form is an in-place sort. whereas merge sort requires O(N) extra storage, N denoting the array size which may be quite expensive.

View Post

QuickSort on Doubly Linked List

Venkatesan Prabu
October 15, 2017
35 shares

35

0

0

QuickSort on Doubly Linked List – Searching and sorting -. The idea is simple, we first find out pointer to last node. Once we have pointer to last node, we can recursively sort the linked list using pointers to first and last nodes of linked list.

View Post

Iterative Quick Sort

Venkatesan Prabu
October 15, 2017

Iterative Quick Sort – Searching and Sorting – Partition process is same in both recursive and iterative. The same techniques to choose optimal pivot can also be applied to iterative version.

View Post

When does the worst case of Quicksort occur?

Venkatesan Prabu
October 15, 2017

When does the worst case of Quicksort occur? – Searching and sorting – Since these cases are very common use cases, the problem was easily solved by choosing either a random index for the pivot.

View Post

Stability in sorting algorithms

Venkatesan Prabu
October 15, 2017

stability in sorting algorithms – Searching and Sorting – Some sorting algorithms are stable by nature like Insertion sort, Merge Sort, Bubble Sort, etc. And some sorting algorithms are not, like Heap Sort, Quick Sort.

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

26 views
3 minute read
No comments

Radix Sort

Venkatesan Prabu
October 15, 2017

Radix Sort – Searching and Sorting -The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc is Ω(nLogn). i.e., they cannot do better than nLogn.

View Post

31 views
6 minute read
No comments

QuickSort

Venkatesan Prabu
October 15, 2017
2 shares

2

0

0

QuickSort – Searching and Sorting – Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions.There are many different versions of quickSort that pick pivot in different ways.

View Post

quick sort algorithm

Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?

QuickSort on Doubly Linked List

Iterative Quick Sort

When does the worst case of Quicksort occur?

Stability in sorting algorithms

ShellSort

Bucket Sort

Counting Sort

Radix Sort

QuickSort

WIKITECHY

WORKSHOP

JOIN OUR COMMUNITY

OTHER LANGUAGES