ACtE07 · Chapter 7Data Structures, DBMS & Operating Systems🏛️ Past Licensure QuestionID: fa5c4360
Sorting pseudo: for i=0..n-1: for j=i+1 n-1: if arr] < arri] swap(arr[i], arr[i]) Identify the sort:
Sorting pseudo: for i=0..n-1: for j=i+1 n-1: if arr] < arri] swap(arr[i], arr[i]) Identify the sort:
Multiple Choice Options
- A
Bubble sort
- B✓ Correct Option
Selection sort
- C
Insertion sort
- D
Quick sort
Detailed Technical Solution & Explanation
According to standard engineering principles, for Sorting pseudo: for i=0..n-1: for j=i+1 n-1: if arr] < arri] swap(arr[i], arr[i]) Identify the sort:, the correct choice is Selection sort.
Option Analysis:
•
Option A (Bubble sort): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
•
Option B (Selection sort): Correct. Valid technical statement directly addressing the question requirement.
•
Option C (Insertion sort): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
•
Option D (Quick sort): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
Reference: Demo2 · Set 1NEC Licensure Syllabus