# Linearithmic Time

*noun*

say it: **“lin-ee-uh-RITH-mik TYM”** **/ˌlɪniəˈrɪðmɪk taɪm/**

Work of about n times log n steps, the speed of a good sorting method.

## What is **linearithmic time**?

**Linearithmic time** is about n × log n steps: a little more than reading every item once, and far less than comparing every pair. Good sorting methods, including the one built into your language, run at this speed. It's written **O(n log n)**.

## In a sentence

- “Your language's built-in sort runs in **linearithmic time**, a little more work than reading the list once.”

Level: Journeyman · [More Software Development terms at this level](https://www.ask-codey.com/glossary?category=software-development&level=3)

Updated: November 9, 2026

Source: https://www.ask-codey.com/glossary/linearithmic-time
