11Which sorting algorithm divides the array into halves, sorts them and merges?ACounting sortBMerge sortCInsertion sortDQuick sortView AnswerDiscussWorkspaceReportSaveEasy
12Radix sort sorts numbers:ADigit by digit using a stable sortBBy swapping neighboursCBy choosing a pivotDBy building a heapView AnswerDiscussWorkspaceReportSaveEasy
13An in-place sorting algorithm:ANeeds a second arrayBNever swaps elementsCUses only O(1) (or small) extra memoryDMust be stableView AnswerDiscussWorkspaceReportSaveEasy
14Counting sort runs in:AO(log n)BO(n²)CO(n log n)DO(n + k), where k is the range of keysView AnswerDiscussWorkspaceReportSaveEasy
15Which sort is stable and works well on nearly sorted data?ASelection sortBInsertion sortCQuick sortDHeap sortView AnswerDiscussWorkspaceReportSaveEasy