# Computer science visualisations on marckimmel.de > Interactive sorting and search algorithms in the browser: bar visualisation, pseudocode with the active line highlighted, step log, runtime and use case. Every page exists in German (the default, without prefix) and in English (under /en). Every link to a page of this site points to its Markdown version: append `.md` to any page address, the home page is `/index.md` (German) and `/en/index.md` (English). The HTML page is the same address without `.md`. Last content change: 2026-10-11. Contact: support@marckimmel.de. Location: Augsburg, Germany. ## Search Algorithms - [Search Algorithms: overview](https://marckimmel.de/en/informatik/suchalgorithmen.md): Linear, binary, Jump, Interpolation and Ternary Search with lo/mid/hi pointers on a sorted bar array. - [Linear Search](https://marckimmel.de/en/informatik/suchalgorithmen/lineare-suche.md): Interactive linear search: compares every index to the target value one after the other. Works on unsorted arrays and streams, runs in O(n) worst case. - [Binary Search](https://marckimmel.de/en/informatik/suchalgorithmen/binaere-suche.md): Interactive binary search: halves the search range using the middle and shifts lo or hi. Requires a sorted array, runs in O(log n) with constant extra memory. - [Jump Search](https://marckimmel.de/en/informatik/suchalgorithmen/jump-suche.md): Interactive Jump Search: jumps through a sorted array in √n strides and then scans the right block linearly. A sweet spot between O(n) and O(log n). - [Interpolation Search](https://marckimmel.de/en/informatik/suchalgorithmen/interpolations-suche.md): Interactive interpolation search: estimates the target position via linear interpolation. Extremely fast on uniformly distributed values, worst case still O(n). - [Ternary Search](https://marckimmel.de/en/informatik/suchalgorithmen/ternaere-suche.md): Interactive ternary search: splits the range at m1 and m2 into three parts. O(log₃ n), asymptotically like binary search, typical for unimodal functions. ## Sorting Algorithms - [Sorting Algorithms: overview](https://marckimmel.de/en/informatik/sortieralgorithmen.md): Bubble, Insertion, Selection, Merge, Quick, Heap, Cocktail, Shellsort, Timsort, Introsort and Radix Sort as a bar animation with pseudocode highlight and step log. - [Bubble Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/bubble-sort.md): Interactive Bubble Sort: bars show every comparison and swap, pseudocode highlights the active line. With runtime in every case, stability and use cases. - [Insertion Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/insertion-sort.md): Interactive Insertion Sort: builds a sorted prefix on the left and shifts each new element into its slot. Linear best case, quadratic worst case, stable. - [Selection Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/selection-sort.md): Interactive Selection Sort: each round finds the minimum of the unsorted suffix and swaps it to the front. Exactly n-1 writes, always O(n^2), not stable. - [Merge Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/merge-sort.md): Interactive Merge Sort: recursive halving and stable merging with L and R buffers. Guaranteed O(n log n), suited as External Sort for data beyond memory. - [Quick Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/quick-sort.md): Interactive Quick Sort: pick a pivot, partition smaller and larger values, recurse on both halves. Average O(n log n), worst case O(n^2), in-place, not stable. - [Heap Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/heap-sort.md): Interactive Heap Sort with tree view: build a max-heap, swap the root with the last heap element and run siftDown. Guaranteed O(n log n), in-place. - [Cocktail Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/cocktail-sort.md): Interactive Cocktail Sort (Shaker Sort): Bubble Sort in both directions. Tackles the turtle problem, worst case O(n^2), stable. - [Shellsort](https://marckimmel.de/en/informatik/sortieralgorithmen/shell-sort.md): Interactive Shellsort: generalised insertion sort that first sorts far-apart pairs and shrinks the gap to 1. Worst case O(n^2) with the standard gap sequence. - [Timsort](https://marckimmel.de/en/informatik/sortieralgorithmen/tim-sort.md): Interactive Timsort: hybrid of insertion sort for small runs and stable bottom-up merge. Default sort in Python and Java, worst case O(n log n) and stable. - [Introsort](https://marckimmel.de/en/informatik/sortieralgorithmen/intro-sort.md): Interactive Introsort: Quick Sort that falls back to Heap Sort when recursion gets too deep and sorts small ranges with Insertion Sort. Guaranteed O(n log n). - [Radix Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/radix-sort.md): Interactive Radix Sort (LSD): stable Counting Sort per digit, base 10 with 10 buckets. Linear O(d · n) for integer keys with a fixed number of digits. - [Bogo Sort](https://marckimmel.de/en/informatik/sortieralgorithmen/bogo-sort.md): Interactive Bogo Sort: joke algorithm that Fisher-Yates-shuffles the array until it is sorted by chance. Expected runtime O(n · n!), worst case unbounded. ## Number Encodings - [Number Encodings: overview](https://marckimmel.de/en/informatik/zahlenkodierungen.md): Binary, 1-complement, 2-complement, excess-q, fixed-point, floating-point, b-adic and bitops with fine-grained Horner steps and bit-level visualisation. - [B-adic / Horner method](https://marckimmel.de/en/informatik/zahlenkodierungen/b-adisch.md): Interactive b-adic representation: Horner conversion with fine-grained division and remainder steps, polynomial form, switch between any bases 2..36. - [Binary Encoding](https://marckimmel.de/en/informatik/zahlenkodierungen/binaer.md): Interactive n-bit binary encoding: Horner conversion step by step, bit visualisation, value range, addition with carry and overflow. - [One's Complement](https://marckimmel.de/en/informatik/zahlenkodierungen/einerkomplement.md): Interactive n-bit ones' complement: negation by flipping all bits, double zero, a range symmetric around zero, −127 to 127 with 8 bits. - [Two's Complement](https://marckimmel.de/en/informatik/zahlenkodierungen/zweierkomplement.md): Interactive n-bit two's complement: negation by flipping all bits plus one, unique zero, asymmetric value range. Standard for int8 to int32. - [Bitwise Operators](https://marckimmel.de/en/informatik/zahlenkodierungen/bitops.md): Interactive bitops: column-wise NOT, AND, OR, XOR and shifts on two n-bit patterns. With per-column truth pills and result bit pattern. - [Excess-q](https://marckimmel.de/en/informatik/zahlenkodierungen/exzess-q.md): Interactive excess-q encoding: stores x as x + q in n bits. Used in IEEE 754 characteristics (bias 127 for float, 1023 for double). - [Fixed-point](https://marckimmel.de/en/informatik/zahlenkodierungen/festkomma.md): Interactive fixed point with n bits and k fractional digits: multiplication by a power of two, rounding, Horner conversion, rounding error and value range. - [Floating-point](https://marckimmel.de/en/informatik/zahlenkodierungen/gleitkomma.md): Interactive floating-point encoding: sign, characteristic (excess-q) and mantissa step by step, with bit visualisation and rounding error. ## Character Encodings - [Character Encodings: overview](https://marckimmel.de/en/informatik/zeichenkodierungen.md): ASCII table with a mini converter, text-to-binary/octal/dec/hex converter, Base64 encode and decode plus a cryptographically secure password generator. - [ASCII Table](https://marckimmel.de/en/informatik/zeichenkodierungen/ascii-tabelle.md): Complete ASCII table 0 to 127 with decimal, hex and character. Search jumps to the hit and shows octal, binary and the meaning of control characters. - [Converter](https://marckimmel.de/en/informatik/zeichenkodierungen/umrechner.md): Converts text into binary, octal, decimal or hex and back. With separator choice, fixed-width padding (8/3/2 digits) and a per-character codepoint preview. - [Base64](https://marckimmel.de/en/informatik/zeichenkodierungen/base64.md): Base64 encode and decode in the browser. Handles umlauts, emojis and any Unicode character via UTF-8 and reports charset errors separately. - [Password Generator](https://marckimmel.de/en/informatik/zeichenkodierungen/passwort-generator.md): Password generator with lowercase, uppercase, digits and symbols, up to 128 characters, cryptographic randomness and a strength and entropy display. ## Optional - [Overview of all areas](https://marckimmel.de/en/informatik.md): Interactive sorting and search algorithms in the browser: bar visualisation, pseudocode with the active line highlighted, step log, runtime and use case. - [Site index](https://marckimmel.de/llms.txt): All areas of marckimmel.de.