bubble sort c Archives

Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted

Venkatesan Prabu
October 15, 2017

Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted -Searching and sorting – Given an unsorted array arr[] of size n. find the minimum length subarray arr[s..e]

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

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

73 views
2 minute read
No comments

Heap Sort

Venkatesan Prabu
October 15, 2017
1 share

1

0

0

Heap Sort – Searching and Sorting – Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort.where we first find the maximum element and place the maximum element at the end.

View Post

Merge Sort

Venkatesan Prabu
October 15, 2017

Merge Sort – searching and sorting algorithm – Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves.

View Post

Bubble Sort

Venkatesan Prabu
October 15, 2017
4 shares

4

0

0

Bubble Sort – searching and sorting algorithm – Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements .

View Post

Selection Sort

Venkatesan Prabu
October 15, 2017
7 shares

7

0

0

Selection Sort – searching and sorting algorithm – The selection sort algorithm sorts an array by repeatedly finding the minimum element .

View Post

bubble sort c

Stability in sorting algorithms

ShellSort

Bucket Sort

Heap Sort

Merge Sort

Bubble Sort

Selection Sort

WIKITECHY

WORKSHOP

JOIN OUR COMMUNITY

OTHER LANGUAGES