Which sorting algorithm does Oracle follow? | Oracle DBA

Oracle used to follow a balanced binary tree sorting algorithm to effectively build an n-memory index on the incoming data.
Binary tree search places a huge memory and CPU overhead on the system for large searches; therefore, Oracle introduced an algorithm based on heap sort, which is more efficient. However, it also has a limitation of re-ordering incoming rows even when the data is not arriving out of order.