Mark As Completed Discussion
Home > First step > First step > Introduction to Data Structures

Try this exercise. Click the correct answer from the options.

Which sorting algorithm is known for its average time complexity of O(n log n)?

Click the option that best answers the question.

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort

Programming Categories

  • Basic Arrays Interview Questions
  • Binary Search Trees Interview Questions
  • Dynamic Programming Interview Questions
  • Easy Strings Interview Questions
  • Frontend Interview Questions
  • Graphs Interview Questions
  • Hard Arrays Interview Questions
  • Hard Strings Interview Questions
  • Hash Maps Interview Questions
  • Linked Lists Interview Questions
  • Medium Arrays Interview Questions
  • Queues Interview Questions
  • Recursion Interview Questions
  • Sorting Interview Questions
  • Stacks Interview Questions
  • Systems Design Interview Questions
  • Trees Interview Questions

    • Popular Lessons

  • All Courses, Lessons, and Challenges
  • Data Structures Cheat Sheet
  • Free Coding Videos
  • Bit Manipulation Interview Questions
  • Javascript Interview Questions
  • Python Interview Questions
  • Java Interview Questions
  • SQL Interview Questions
  • QA and Testing Interview Questions
  • Data Engineering Interview Questions
  • Data Science Interview Questions
  • Blockchain Interview Questions
  • Real-World Project: Payment App
  • Control Flow: If/Else and Try/Catch Statements
  • Introduction to Amazon Auto Scaling Group
  • Apache HTTP Server (CRM)
  • Introduction to System Design and Architecture