Sorting
CUET Computer Science Key cards: 5 of this chapter’s 29 are free to read, with no account.
Say the answer in your head, then turn the card over.
The 5 free cards from Sorting
Card 1 of 5
Types
Name the three sorting methods learnt in this chapter.
Types
Name the three sorting methods learnt in this chapter.
- Bubble sort
- selection sort
- insertion sort
Computer Science - Class XII, Ch 5, p. 68
Definition
What is bubble sort?
Definition
What is bubble sort?
It sorts a given list of elements by repeatedly comparing the adjacent elements and swapping them if they are unordered.
Computer Science - Class XII, Ch 5, p. 68
Definition
What does swapping two elements mean?
Definition
What does swapping two elements mean?
Swapping two elements means changing their positions with each other.
Computer Science - Class XII, Ch 5, p. 68
Definition
What is insertion sort?
Definition
What is insertion sort?
Insertion sort is another sorting algorithm that can arrange elements of a given list in ascending or descending order.
Computer Science - Class XII, Ch 5, p. 74
Definition
What is the time complexity of an algorithm?
Definition
What is the time complexity of an algorithm?
The amount of time an algorithm takes to process a given data can be called its time complexity.
Computer Science - Class XII, Ch 5, p. 77