Home › Courses › GATE CSE › Algorithms › SortingGATE CSE Sorting — practice questions Explore 1 free Sorting questions in GATE CSE Algorithms. Open each question or exercise to read its content, reference answers and available explanation.
Practise Sorting with Quill → Sorting questions and exercises with answers Showing questions 1–1 of 1.
Worked practice questions Sorting algorithms — true or false? Read exercise and reference answers Questions Statement is true Yes Statement Merge Sort is a stable sort. Statement is true Yes Statement Quick Sort has O(n²) worst-case time complexity. Statement is true Yes Statement Heap Sort is an in-place sort with O(n log n) time. Statement is true No Statement Counting Sort can sort floating-point numbers in O(n) time. Open this exercise →
How to practise Choose a Sorting question and try to work out your answer. Open the question to check the correct answer and read its worked solution. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account. 
alleryStart learning →