# Ordinal Data - Heapsort sorting algorithm

### Table of Contents

## About

The heap sorting algorithm is a sorting algorithm based on a binary heap (ie binary tree) introduced by J. W. J. Williams in 1964

The heap sorting algorithm is a sorting algorithm based on a binary heap (ie binary tree) introduced by J. W. J. Williams in 1964

**Data (State)**

Data (State)

DataBase

Data Processing

Data Quality

Data Structure

Data Type

Data Warehouse

Data Visualization

Data Partition

Data Persistence

Data Concurrency

**Data Science**

Data Analysis

Statistics

Data Science

Linear Algebra
Mathematics

Trigonometry

**Infrastructure**

Operating System

Monitoring

Cryptography

Security

File System

Network

Process (Thread)

Computer

Infra As Code

**Marketing**

Advertising

Analytics

Email

**Contact**

[email protected]

Privacy Policy

Status