Arranging a collection of elements into a particular order is called:

ASorting

BStoring

CScaling

DSharing

Answer & Solution

Correct answer: A. Sorting

1. The elements themselves do not change. 2. Only their arrangement is altered. 3. That process is sorting. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._

Practise this question with Quill — Engineering — Tanzania →

Keep practising Sorting Algorithms

Browse all Sorting Algorithms questions for Engineering — Tanzania, or explore more Computer Science topics.

Start a Sorting Algorithms lesson →

Related questions

Bubble sort, selection sort and insertion sort all have a time complexity of:When a program contains both a nested loop and a single loop, complexity is judged from th Algorithms whose running time follows that nested pattern are called:A loop placed inside another loop gives a time complexity of:Algorithms whose running time grows in step with the input are called:An algorithm with a single loop running from 1 to n has a time complexity of:An algorithm with no loop at all has a time complexity of:With huge real-world data sets, comparing algorithms before choosing one becomes: