Explanation: As counting sort is an example of non comparison sort so it is able to sort an array without making any comparison.

Table of Contents

## Which of following is non comparison sorting?

Explanation: As counting sort is an example of non comparison sort so it is able to sort an array without making any comparison.

**Is counting sort a non comparison sort?**

Counting sort is not a comparison sort; it uses key values as indexes into an array and the Ω(n log n) lower bound for comparison sorting will not apply.

**What is the difference between comparison and non comparison sorting algorithm?**

A comparison sort algorithm sorts items by comparing values between each other. It can be applied to any sorting cases. And the best complexity is O(n*log(n)) which can be proved mathematically. A non-comparison sort algorithm uses the internal character of the values to be sorted.

### Which of the following algorithm is used to sort non integer data elements?

Explanation: Counting sort is used as a sub routine for radix sort as it is a stable and non comparison based sorting algorithm.

**What is a non comparative sorting algorithm?**

Non-comparison sorting algorithms include Counting sort which sorts using key-value, Radix sort, which examines individual bits of keys, and Bucket Sort which examines bits of keys. These are also known as Liner sorting algorithms because they sort in O(n) time.

**Which is not inplace sorting algorithm?**

Merge-sort is an example of not-in-place sorting.

#### How many types of sort have in non Based sorting?

The three types of basic sorting are bubble sort, insertion sort and selection sort. What is Sorting and types of sorting in data structure? Sorting is the processing of arranging the data in ascending and descending order.

**Which of the following is not an example of non comparison sort?**

Bubble sort is not an example of non comparison sort as it needs to compare array elements in order to sort an array.

**Which of the following is not sorting method?**

Answer: quick sort is the only algorithm that is not stable.

## What is inplace and outplace algorithm?

In-Place means your sorting algorithm does not use any extra memory other than the array to sort, while out-of-place means that your sorting algorithm uses extra memory.

**What is in-place and outplace sorting?**

An in-place sorting algorithm sorts the elements in place: that is, it needs only O(1) extra space. An out-of-place sorting algorithm needs extra space to put the elements in as it’s sorting them. Usually this means O(n) extra space.