Timsort in JavaScript (Running in the Browser!)

kirupa · September 12, 2024, 4:16am

Hi everybody! In my latest article (and video), I talk about Timsort and how it works to be one of the fastest sorting algorithms:

Now, Timsort is a fairly complex sorting algorithm. Instead of rewriting it myself for the tutorial, I decided to take a popular node version and turn it into a JS version that runs in the browser.

This “Timsort in the browser” version can be seen here:

github.com

kirupa/kirupa/blob/master/data_structures_algorithms/timsort.htm

<!DOCTYPE html>
<html lang="en">

<head>
  <meta charset="UTF-8">
  <meta name="viewport" content="width=<device-width>, initial-scale=1.0">
  <title>Timsort in JavaScript</title>
</head>

<body>
  <script>
    //
    // Based on: https://github.com/mziccard/node-timsort
    //
    // To learn more about how Timsort works, go here: https://www.kirupa.com/sorts/timsort.htm
    //
    let timsort = "";

    (function () { function r(e, n, t) { function o(i, f) { if (!n[i]) { if (!e[i]) { var c = "function" == typeof require && require; if (!f && c) return c(i, !0); if (u) return u(i, !0); var a = new Error("Cannot find module '" + i + "'"); throw a.code = "MODULE_NOT_FOUND", a } var p = n[i] = { exports: {} }; e[i][0].call(p.exports, function (r) { var n = e[i][1][r]; return o(n || r) }, p, p.exports, r, e, n, t) } return n[i].exports } for (var u = "function" == typeof require && require, i = 0; i < t.length; i++)o(t[i]); return o } return r })()({
      1: [function (require, module, exports) {

This file has been truncated. show original

Hope you all find it helpful

Cheers,
Kirupa

Timsort in JavaScript (Running in the Browser!)

Follow:

Popular

Loose Ends