Free Test Algorithms sort – C++ Lan...

Q1: What is the default sorting algorithm used by std::sort in C++?

A. Quick Sort B. Merge Sort C. Intro Sort D. Bubble Sort

Q2: Which header file must be included to use std::sort?

A. <algorithm> B. <vector> C. <iterator> D. <functional>

Q3: What is the time complexity of std::sort on average?

A. O(n) B. O(n log n) C. O(n^2) D. O(log n)

Q4: Which of the following statements about std::sort is true?

A. It can sort arrays and vectors B. It can sort only vectors C. It can sort only arrays D. It cannot sort STL containers

Q5: What kind of iterator does std::sort require?

A. Input iterator B. Forward iterator C. Random access iterator D. Bidirectional iterator

Q6: How can you sort a vector of integers in descending order using std::sort?

A. std::sort(v.begin(), v.end()) B. std::sort(v.begin(), v.end(), std::greater<int>()) C. std::sort(v.begin(), v.end(), std::less<int>()) D. std::sort(v.rbegin(), v.rend())

Q7: What happens if you call std::sort on a container with less than two elements?

A. Error at compile time B. Nothing happens, container remains unchanged C. Container is cleared D. Undefined behavior

Q8: Which algorithm would you use to partially sort the first k elements?

A. std::sort B. std::partial_sort C. std::nth_element D. std::stable_sort

Q9: How is std::stable_sort different from std::sort?

A. It is faster B. It preserves relative order of equal elements C. It only works on arrays D. It requires bidirectional iterators

Q10: What is the time complexity of std::stable_sort?

A. O(n) B. O(n log n) C. O(n^2) D. O(log n)

Q11: Which algorithm is best for sorting nearly sorted data?

A. std::sort B. std::stable_sort C. std::insertion_sort D. std::partial_sort

Q12: Which of the following is NOT a requirement for the elements in std::sort?

A. Must be copyable B. Must support operator< C. Must be moveable D. Must be comparable using operator==

Q13: What is the signature of std::sort function?

A. template <class RandomIt> void sort(RandomIt first, RandomIt last); B. template <class T> void sort(T first, T last); C. template <class RandomIt> void sort(RandomIt first, RandomIt last, Compare comp); D. Both A and C are correct

Q14: Which comparator can be used to sort strings ignoring case?

A. std::less<string> B. std::greater<string> C. Custom comparator using transform to lower D. std::equal_to<string>

Q15: What is the effect of sorting a container with std::sort without a comparator?

A. Sorts in ascending order B. Sorts in descending order C. Leaves container unchanged D. Throws an exception

Q16: Is std::sort a stable sorting algorithm?

A. Yes B. No C. Depends on compiler D. Only for certain data types

Q17: Which algorithm would you choose to get the nth largest element efficiently?

A. std::sort B. std::partial_sort C. std::nth_element D. std::stable_sort

Q18: What does std::is_sorted check?

A. If container is sorted in ascending order B. If container is sorted in descending order C. If container is empty D. If container has duplicates

Q19: Can std::sort be used on a std::list container?

A. Yes B. No C. Only if converted to vector first D. Only with a custom comparator

Q20: What is the average time complexity of std::sort?

A. O(n) B. O(n log n) C. O(n^2) D. O(log n)

Q21: Which header file is required to use std::sort?

A. <vector> B. <algorithm> C. <iostream> D. <iterator>

Q22: Which iterator category is required by std::sort?

A. Input Iterator B. Forward Iterator C. Bidirectional Iterator D. Random Access Iterator

Q23: How to sort a vector in descending order using std::sort?

A. std::sort(v.begin(), v.end()) B. std::sort(v.begin(), v.end(), std::greater<int>()) C. std::sort(v.begin(), v.end(), std::less<int>()) D. std::sort(v.rbegin(), v.rend())

Q24: What does std::stable_sort guarantee?

A. Faster sorting B. Stable order of equivalent elements C. Less memory usage D. Sorting in descending order

Q25: Which algorithm partially sorts the first k elements?

A. std::sort B. std::partial_sort C. std::nth_element D. std::stable_sort

Q26: Which algorithm places the nth element in its sorted position?

A. std::sort B. std::partial_sort C. std::nth_element D. std::stable_sort

Q27: Is std::sort a stable sorting algorithm?

A. Yes B. No C. Depends on compiler D. Only for built-in types

Q28: What will happen if std::sort is used on a container with non-random access iterators?

A. Compile error B. Runs slower C. Undefined behavior D. Works normally

Q29: How to sort a C-style array using std::sort?

A. std::sort(arr); B. std::sort(arr, arr + size); C. std::sort(arr.begin(), arr.end()); D. std::sort(arr.begin(), arr + size);

Q30: What does std::sort use internally?

A. Quick sort only B. Merge sort only C. Intro sort (quick + heap + insertion) D. Bubble sort

Q31: Can std::sort sort custom objects?

A. Yes, if operator< is defined B. Yes, if operator== is defined C. No D. Only with a custom comparator

Q32: Which comparator would sort strings ignoring case?

A. std::less<string> B. Custom comparator using transform to lowercase C. std::greater<string> D. std::equal_to<string>

Q33: How do you specify a custom sorting order in std::sort?

A. Using a custom comparator function as third argument B. Using std::greater as first argument C. Using operator== D. Using a special template

Q34: What is the effect of calling std::sort on an empty container?

A. Throws exception B. No operation performed C. Undefined behavior D. Segmentation fault

Q35: Which of these is NOT true about std::sort?

A. It requires random access iterators B. It can sort linked lists directly C. It sorts in ascending order by default D. It has average time complexity O(n log n)

Q36: How can you sort elements in reverse using std::sort?

A. Use std::sort with std::greater comparator B. Use std::reverse on sorted container C. Use std::stable_sort D. Both A and B

Q37: Which algorithm is best suited for small arrays?

A. std::sort B. Insertion sort C. std::partial_sort D. Heap sort

Q38: What happens to the relative order of equal elements when sorted using std::sort?

A. Preserved B. Not guaranteed to be preserved C. Always reversed D. Maintained only for integers

Q39: Which function can check if a range is sorted?

A. std::sort B. std::is_sorted C. std::nth_element D. std::stable_sort

Quiz for Algorithms sort

Q1: What is the default sorting algorithm used by std::sort in C++?

Q2: Which header file must be included to use std::sort?

Q3: What is the time complexity of std::sort on average?

Q4: Which of the following statements about std::sort is true?

Q5: What kind of iterator does std::sort require?

Q6: How can you sort a vector of integers in descending order using std::sort?

Q7: What happens if you call std::sort on a container with less than two elements?

Q8: Which algorithm would you use to partially sort the first k elements?

Q9: How is std::stable_sort different from std::sort?

Q10: What is the time complexity of std::stable_sort?

Q11: Which algorithm is best for sorting nearly sorted data?

Q12: Which of the following is NOT a requirement for the elements in std::sort?

Q13: What is the signature of std::sort function?

Q14: Which comparator can be used to sort strings ignoring case?

Q15: What is the effect of sorting a container with std::sort without a comparator?

Q16: Is std::sort a stable sorting algorithm?

Q17: Which algorithm would you choose to get the nth largest element efficiently?

Q18: What does std::is_sorted check?

Q19: Can std::sort be used on a std::list container?

Q20: What is the average time complexity of std::sort?

Q21: Which header file is required to use std::sort?

Q22: Which iterator category is required by std::sort?

Q23: How to sort a vector in descending order using std::sort?

Q24: What does std::stable_sort guarantee?

Q25: Which algorithm partially sorts the first k elements?

Q26: Which algorithm places the nth element in its sorted position?

Q27: Is std::sort a stable sorting algorithm?

Q28: What will happen if std::sort is used on a container with non-random access iterators?

Q29: How to sort a C-style array using std::sort?

Q30: What does std::sort use internally?

Q31: Can std::sort sort custom objects?

Q32: Which comparator would sort strings ignoring case?

Q33: How do you specify a custom sorting order in std::sort?

Q34: What is the effect of calling std::sort on an empty container?

Q35: Which of these is NOT true about std::sort?

Q36: How can you sort elements in reverse using std::sort?

Q37: Which algorithm is best suited for small arrays?

Q38: What happens to the relative order of equal elements when sorted using std::sort?

Q39: Which function can check if a range is sorted?