algorithm analysis

DeWu Technology

Dec 26, 2021 · Backend Development

Behind the Scenes of Arrays.sort: What Does JDK Do?

The article demystifies Java’s Arrays.sort by tracing its call to TimSort.sort, explaining how the hybrid Timsort algorithm blends merge and insertion sorts, determines minimum run lengths, partitions and merges runs, addresses implementation bugs such as stack allocation and comparator misuse, and celebrates its elegant, efficient design.

Arrays.sortBackend DevelopmentJDK

0 likes · 15 min read

Behind the Scenes of Arrays.sort: What Does JDK Do?

Selected Java Interview Questions

Jul 4, 2021 · Fundamentals

Understanding Time Complexity and Big O Notation with Java Examples

This article explains the concept of constant‑time operations, introduces Big O notation for describing algorithmic time complexity, and demonstrates how to calculate and interpret complexities such as O(1), O(N), O(N²) and O(N²·logN) through clear Java code examples.

JavaTime Complexityalgorithm analysis

0 likes · 7 min read

Understanding Time Complexity and Big O Notation with Java Examples

Laravel Tech Community

Jun 20, 2021 · Operations

Traditional and Real-Time Elevator Scheduling Algorithms

The article surveys traditional elevator dispatching methods such as FCFS, SSTF, SCAN, LOOK, and SATF, then examines real‑time strategies like EDF, SCAN‑EDF, PI, and FD‑SCAN, and concludes with a discussion of modern group‑control research and detailed system requirement analysis.

algorithm analysisdispatch algorithmselevator scheduling

0 likes · 9 min read

Traditional and Real-Time Elevator Scheduling Algorithms

Java Captain

Jun 12, 2019 · Fundamentals

Comprehensive Guide to Ten Common Sorting Algorithms with Visual Explanations and Java Implementations

This article provides a detailed, step‑by‑step walkthrough of ten widely used sorting algorithms—including bubble, selection, insertion, shell, merge, quick, heap, counting, bucket, and radix sorts—explaining their principles, visualizing each pass, analyzing time and space complexities, and presenting complete Java code examples for every method.

Data StructuresJavaalgorithm analysis

0 likes · 33 min read

Comprehensive Guide to Ten Common Sorting Algorithms with Visual Explanations and Java Implementations

Hujiang Technology

Aug 7, 2017 · Frontend Development

Reverse Engineering a One‑Line JavaScript Animation: Step‑by‑Step Explanation

This article walks through the reverse‑engineering of a compact JavaScript one‑liner that draws a patterned image, refactors it into readable modules, explains each transformation—including variable renaming, loop conversion, ternary expansion, bitwise operations, and switch‑case replacement—while illustrating the underlying math with graphs and code snippets.

Bitwise OperationsFrontend DevelopmentJavaScript

0 likes · 18 min read

Reverse Engineering a One‑Line JavaScript Animation: Step‑by‑Step Explanation

Qunar Tech Salon

Apr 4, 2015 · Fundamentals

Greedy Algorithm: Concepts, Basic Approach, Applicability, and Example Analysis

This article explains the fundamental concepts of greedy algorithms, outlines their basic design steps, discusses the conditions under which they yield optimal solutions, presents an implementation framework, and analyzes a knapsack problem example that illustrates common greedy strategies and their limitations.

algorithm analysisgreedy algorithmknapsack problem

0 likes · 6 min read

Greedy Algorithm: Concepts, Basic Approach, Applicability, and Example Analysis