Courses
- For Working Professionals
- For Students
- Complete Preparation Packages
- Programming Languages
- Web Development
- Machine Learning and Data Science
- School Courses
- All Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- Software Designs
  - Software Design Patterns
  - System Design Tutorial
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- School Learning
  - School Programming
  - Mathematics
  - Maths Notes (Class 8-12)
  - NCERT Solutions
  - RD Sharma Solutions
  - Physics Notes (Class 8-11)
  - Chemistry Notes
  - Business Studies (Class 11th)
  - Business Studies (Class 12th)
  - Accountancy (Class 12th)
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
- Apply for Jobs
- Post a Job
  - Hire with Us
  - Know about Jobathon
- Jobathon
Practice
Contests

Algorithms | Sorting | Question 15

Difficulty Level : Easy
Last Updated : 28 Jun, 2021

Read

Discuss

Practice

Video

Courses

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.
(A) Insertion Sort
(B) Heap Sort
(C) Merge Sort
(D) Selection Sort

Answer: (A)

Explanation: The insertion sort will take $\theta$ (n) time when input array is already sorted.

Quiz of this Question