Tagged articles
4 articles
Page 1 of 1
Code Mala Tang
Code Mala Tang
Apr 12, 2025 · Fundamentals

Mastering Manacher’s Algorithm: Find the Longest Palindromic Substring in O(N)

Manacher’s algorithm transforms the classic longest palindromic substring problem into a linear‑time solution by preprocessing the string with separators, tracking palindrome radii, and efficiently updating the center and right boundary using mirror positions, with detailed Python code and step‑by‑step illustrations.

Manacher algorithmPythonString processing
0 likes · 12 min read
Mastering Manacher’s Algorithm: Find the Longest Palindromic Substring in O(N)
360 Tech Engineering
360 Tech Engineering
Dec 11, 2020 · Fundamentals

Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation

This article explains the heap sort algorithm, describing the heap data structure, the process of building a max‑heap, the sorting loop with element swaps, and provides detailed Java code examples along with key points and an illustrative example array.

Data StructuresSorting Algorithmalgorithm tutorial
0 likes · 5 min read
Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation
Liangxu Linux
Liangxu Linux
May 31, 2020 · Fundamentals

Master the Top 10 Classic Sorting Algorithms with Code and Visualizations

This article systematically presents ten classic sorting algorithms—bubble, selection, insertion, quick, heap, merge, shell, counting, bucket, and radix—detailing their concepts, time and space complexities, step‑by‑step logic, animated illustrations, and complete source code examples in C++ and JavaScript.

C++Data StructuresJavaScript
0 likes · 19 min read
Master the Top 10 Classic Sorting Algorithms with Code and Visualizations