Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Heapsort

Theory

Match complexities

Report a typo

Match the procedures with their complexities:

Match the items from left and right columns
HEAPSORT
BUILD-HEAP
HEAPIFY
O(log(n))O(log(n))
O(n∗log(n))O(n*log(n))
O(n)O(n)
___

Create a free account to access the full topic