CrashCourse Computer Science: Algorithms and Sorting

What is the main focus of the CrashCourse Computer Science series?

• Programming languages

• Algorithms and data structures

• History of computers

• Computer hardware

Who is credited with the term 'algorithm'?

• Muḥammad ibn Mūsā al-Khwārizmī

• Alan Turing

• Ada Lovelace

• Isaac Newton

What is a common use of sorting algorithms in everyday applications?

• Playing music

• Sorting emails by date

• Calculating taxes

• Editing photos

What is the main goal of a sorting algorithm?

• To split arrays

• To arrange items in a specific order

• To merge arrays

• To find the largest number

In the Selection Sort algorithm, what is the first step?

• Splitting the array

• Finding the largest number

• Merging arrays

• Finding the smallest number

What is the computational complexity of the Selection Sort algorithm?

• N

• N squared

• N log N

• N factorial

What does the 'Big O' notation represent in computer science?

• The programming language used

• The type of data structure

• The efficiency of an algorithm

• The size of the input

What is the first step in the Merge Sort algorithm?

• Finding the smallest number

• Finding the largest number

• Splitting the array

• Merging arrays

How does the computational complexity of Merge Sort compare to Selection Sort?

• Selection Sort is more efficient

• Merge Sort is more efficient

• Both have the same efficiency

• Merge Sort is less efficient

What is the main advantage of Merge Sort over Selection Sort?

• It has a lower computational complexity

• It uses less memory

• It works better with small datasets

• It is easier to implement