Tagged articles
recursion
96 articles · Page 1 of 1
This article explains binary tree representation in Java and demonstrates recursive pre-order, in-order, post-order, and iterative level-order traversals, plus methods to create a full binary tree, count nodes, compute height, and count leaf nodes with complete runnable code.
AlgorithmJavaQueue
0 likes · 9 min read


liandkSep 2, 2026 · Fundamentals
This article introduces binary trees, explains key terminology and four common tree shapes, details four traversal methods, provides a complete Python implementation with sample output, and highlights real‑world uses and beginner pitfalls.
Pythonbinary treedata structures
0 likes · 7 min read

The article systematically explains the most common algorithms—search, sorting, two‑pointer, hash, recursion, graph traversal, greedy and dynamic programming—detailing their principles, typical use cases, real‑world code examples, and practical advice for when to apply or avoid them in everyday software development.
AlgorithmsBFSDFS
0 likes · 15 min read

This article explains what deep copy is, why it is essential for avoiding side‑effects in mutable data structures, outlines its practical benefits such as safe snapshots and independent cloning of complex objects, and provides a complete JavaScript implementation that handles primitives, circular references, and special built‑in types.
Deep CopyImmutable Datacloning
0 likes · 4 min read

This article explains that PHP’s count() and sizeof() are interchangeable aliases, demonstrates their identical behavior with examples, discusses when to prefer one over the other, and shares performance, recursion, and object‑handling tips for backend developers.
COUNTPHParray
0 likes · 4 min read

This article explains the definitions, mathematical foundations, classic examples, solving methods, and practical differences between recurrence relations and recursion, illustrating how each approach works, their implementation details, and how they can be transformed into one another.
algorithm designalgorithm fundamentalsmathematics
0 likes · 8 min read

This article demonstrates how straightforward mathematical models—ranging from basic calculations for translation time, linear equations for shopping costs, linear programming for work‑life balance, recursive sequences for weight loss, to differential equations for team collaboration—can efficiently analyze and communicate everyday problems.
everyday problemslinear equationsmathematical modeling
0 likes · 6 min read

This article examines whether the C/C++ entry‑point function main can call itself recursively, outlines the relevant language standards, shows compiler support and example code, discusses practical limitations such as stack size and portability, and recommends safer programming patterns.
C++C++Compiler
0 likes · 8 min read

This article explains the fundamental differences between stack and heap memory allocation, covering their allocation mechanisms, performance characteristics, typical use cases such as stack overflow and memory leaks, and provides C and C++ code examples to illustrate each concept.
C++Memory Leakheap memory
0 likes · 60 min read

This article explains PHP’s array_replace_recursive function, detailing its syntax, recursive merging behavior, key‑overriding rules, and differences from array_merge_recursive, accompanied by clear code examples and output to help developers efficiently combine multidimensional arrays.
PHParray mergefunctions
0 likes · 4 min read

This article explores the concept of functions from their mathematical definition through programming language implementation, detailing key elements, stack-based execution mechanics in C, and three perspectives: functions as reusable abstraction units, control flow management tools via call stacks and callbacks, and operators in dataflow architecture pipelines.
call stackcallbacksdataflow architecture
0 likes · 8 min read

This article introduces recursion, explains its definition and key characteristics, and demonstrates classic Python examples such as factorial calculation, Fibonacci sequence generation, and binary search, helping readers grasp how recursion simplifies complex problems compared to iterative loops.
AlgorithmFibonacciPython
0 likes · 8 min read

This article explains the fundamentals of recursion in Java, covering its definition, advantages and disadvantages, differences from iteration, and provides practical examples such as traversing comment and department trees, along with code snippets, performance considerations, and improvement strategies using depth control and Stream API.
AlgorithmCode ExampleJava
0 likes · 7 min read

This article explains the concept of pre-order (root-left-right) tree traversal, demonstrates how to represent binary trees in PHP, provides recursive and stack‑based iterative implementations, and includes an interactive script that lets users build a tree and choose traversal methods, with full example code.
AlgorithmPHPPre-order
0 likes · 9 min read

This article explains step by step how Python creates a function object, builds a call stack, handles parameters, executes the body, performs garbage collection, and manages recursion, illustrating each stage with clear code examples and diagrams.
Function CallPythongarbage collection
0 likes · 8 min read

This article explores Python function nesting, covering its basic concepts, practical applications, code examples, and important considerations for effective implementation in programming.
PythonVariable Scopecode encapsulation
0 likes · 7 min read

This article walks through the fundamentals of dynamic programming by illustrating how to solve a staircase climbing problem and a 0/1 knapsack problem, explaining optimal substructure, state transition equations, boundary conditions, and providing both recursive and iterative C++ implementations.
Algorithmdynamic programmingknapsack problem
0 likes · 12 min read

The article reflects on the true nature of technology, describing it as a dynamic, recursive creative system that evolves through combinatorial innovation, recursion, and the capture of natural phenomena, and illustrates these mechanisms with examples from mathematics modeling and historical technological breakthroughs.
Technologyinnovationmodeling
0 likes · 6 min read

This article describes the background, problem definition, recursive algorithm design, Java implementation, deduplication logic, performance considerations, and business impact of a SKU‑level order merging solution for JD Logistics' inbound-to-warehouse process.
AlgorithmBackendlogistics
0 likes · 10 min read

The article explains LeetCode 814, where a binary tree of 0s and 1s is pruned by recursively removing subtrees lacking a 1, using a post‑order traversal that returns null for nodes with value 0 and no retained children, achieving O(n) time and O(h) space.
AlgorithmC++Java
0 likes · 6 min read

This article walks through a Python list‑processing problem that requires summing numbers while skipping any segment that starts with a 6 and ends with the next 9, presenting multiple solution approaches—including index tricks, flag control, while loops, and recursion—to help readers understand and implement the algorithm effectively.
AlgorithmListPython
0 likes · 7 min read

This article presents ten practical Python recursion techniques—including base case identification, progressive convergence, tail‑recursion optimization, memoization, recursion depth management, generator usage, iterative alternatives, recursion‑tree visualization, hybrid approaches, and divide‑and‑conquer implementations—each illustrated with clear code examples to improve performance and avoid stack overflow.
memoizationrecursiontail-recursion
0 likes · 7 min read

This article explores five hybrid recursion‑iteration techniques, outlines their inherent limitations, and provides a step‑by‑step guide for selecting the most suitable approach based on problem nature, performance needs, readability, and resource constraints.
Pythonalgorithm designhybrid algorithms
0 likes · 16 min read

This article explains how to replace recursive functions in PHP with stack‑based iteration, loop‑driven depth‑first tree traversal, and even a goto‑based approach, providing complete code examples and discussing the trade‑offs of each method.
AlgorithmGotoiteration
0 likes · 7 min read

This article traces how simple binary switches evolved into CPUs, machine code, assembly language, control‑flow constructs, recursion, syntax trees, and finally modern compilers that translate human‑readable code into executable instructions.
assemblycompilersfundamentals
0 likes · 12 min read

The article explains how the primitive binary switches of early CPUs evolved through machine code and assembly into high‑level languages, using recursion, syntax trees and compiler concepts to bridge human abstraction with the CPU's concrete operations.
assemblycompilerscomputer architecture
0 likes · 11 min read

This comprehensive guide walks you through Python's core data structures—including lists, stacks, queues, linked lists, trees, heaps, and graphs—explaining their characteristics, common operations, and step‑by‑step code examples, while also covering related algorithms such as recursion, depth‑first and breadth‑first search, cycle detection, and Dijkstra's shortest‑path algorithm.
AlgorithmsGraphPython
0 likes · 77 min read

This article presents LeetCode problem 112 "Path Sum", detailing the problem statement, example inputs and outputs, constraints, a recursive analysis, and complete reference implementations in Java, C++, and Python for determining whether a root‑to‑leaf path equals a given target sum.
AlgorithmC++Java
0 likes · 5 min read

This article explains PHP's array_replace_recursive() function, detailing its syntax, recursive merging behavior, example usage with code, output interpretation, important considerations, and compares it with array_merge_recursive() for effective backend array handling in PHP development.
BackendPHParray
0 likes · 4 min read

From raw binary on punched tape to mnemonic assembly and then to high‑level constructs like if, while, and functions, programmers created recursive grammars that compile source code into abstract syntax trees, which a compiler translates back into machine instructions, illustrating how recursion underpins both programming language design and computation.
CPUCompilerProgramming Language
0 likes · 11 min read

Recursion, a programming technique where a function calls itself, can elegantly solve problems like factorials, Fibonacci sequences, and binary search, and this article explains its definition, key concepts, characteristics, and provides clear Python examples to deepen understanding of this fundamental algorithmic approach.
Algorithmexamplesprogramming fundamentals
0 likes · 8 min read

This article explains the PHP array_replace_recursive() function, its syntax, recursive merging behavior, example usage with code snippets, output interpretation, important considerations, and a comparison with array_merge_recursive() for effective backend array handling.
BackendPHParray merging
0 likes · 4 min read

This article explains how to use PHP's GMP extension to perform fast multiplication of very large integers by applying a divide‑and‑conquer algorithm that reduces the computational complexity and provides a complete PHP implementation.
AlgorithmGMPPHP
0 likes · 5 min read

Happy numbers are positive integers that eventually reach 1 when repeatedly replaced by the sum of the squares of their digits; this article defines them, demonstrates Python implementations using recursion and sets, and explores practical uses in cryptography, game development, and data analysis.
Pythondata analysishappy numbers
0 likes · 5 min read

Binary search is an efficient O(log n) algorithm for locating elements in sorted arrays or intervals, and this article explains its basic principles, recursive and iterative implementations, handling of edge cases, applications such as log file indexing, and extensions to rotated arrays and variable‑length data.
Algorithmbinary searchiteration
0 likes · 18 min read

This guide explains why anonymous functions in Go can be made recursive by assigning them to a variable, shows a complete factorial example with code, and clarifies the underlying type‑declaration trick needed for self‑reference.
Goanonymous functionfactorial
0 likes · 3 min read

This article walks through a Python solution for automatically extracting multiple nested ZIP archives, providing a complete script that recursively unpacks zip files, explains the logic, and offers tips for sharing code and handling large data files in automation workflows.
Unzipfile-automationrecursion
0 likes · 4 min read

This article explains PHP's array_replace_recursive() function, detailing its syntax, recursive merging behavior, example usage with code snippets, output interpretation, and important considerations such as key overwriting and differences from array_merge_recursive(), providing developers with a practical guide for combining arrays.
arrayphp-functionsrecursion
0 likes · 4 min read

This article explains the PHP array_merge_recursive() function, its syntax, parameters, return values, usage examples with code, and important considerations when merging multidimensional arrays, highlighting how duplicate keys are combined into arrays.
Backendarraymerge
0 likes · 4 min read

This article explains how to boost PHP application performance by using caching functions, efficient array functions, selective database queries, and recursive functions, providing clear code examples for each technique.
BackendCachingarray-functions
0 likes · 5 min read

This article provides a thorough overview of essential C language concepts frequently asked in interviews, covering topics such as language basics, keywords, variables, pointers, arrays, memory management, functions, recursion, data structures, preprocessor directives, and practical code examples to help readers master high‑frequency C interview questions.
c-programminginterview preparationpointers
0 likes · 70 min read

This article explains the DNS caching strategy, the difference between recursive and iterative queries, and how resolvers and authoritative servers cooperate to translate hostnames into IP addresses while optimizing network resources.
CachingDNSiteration
0 likes · 4 min read

This article explains the LeetCode 39 "Combination Sum" problem, illustrates recursion with an apple‑picking analogy, details the backtracking algorithm pattern, and provides a complete, well‑commented Go implementation that handles unlimited reuse of candidates and pruning based on the target sum.
GoLeetCodebacktracking
0 likes · 5 min read

This article explains a recursive solution in Go for LeetCode problem 92, detailing how to reverse a sublist of a singly linked list between given positions by first locating the start node, using a helper to reverse the first n nodes, and correctly reconnecting the remaining parts.
GoLeetCodelinked list
0 likes · 5 min read

This article explains the PHP count() function, covering its syntax, required and optional parameters, return values, practical examples for arrays, objects, and multidimensional structures, as well as common pitfalls and best practices for accurate length calculations.
COUNTObjectarray
0 likes · 5 min read

This guide demonstrates how to generate a fractal tree in Python using Matplotlib, covering library imports, functions for rotation, distance calculation, split-point determination, and a recursive drawing algorithm that visualizes branching structures.
Pythondata visualizationfractal
0 likes · 5 min read

This article provides a comprehensive overview of fourteen algorithmic strategies—including greedy, recurrence, recursion, enumeration, backtracking, divide‑and‑conquer, and dynamic programming—explaining their characteristics, typical use cases, inter‑relationships, and the types of problems each approach best addresses.
AlgorithmsDivide and Conquerdynamic programming
0 likes · 9 min read

This article presents a PHP class that implements common algorithms such as Fibonacci (recursive and iterative), directory scanning, binary search, bubble sort, quick sort, and the first LeetCode problem, along with a completed‑vs‑TODO list for future extensions.
AlgorithmsPHPdata-structures
0 likes · 5 min read

The article explains that dynamic programming boils down to two core ideas—treating problems as a set of independent sub‑problems via divide‑and‑conquer and using memoization to avoid redundant calculations—illustrated with analogies to business management and contrasted with plain recursion.
Divide and Conqueralgorithm fundamentalsdynamic programming
0 likes · 6 min read

Learn how to implement the classic Tower of Hanoi puzzle in Go by exploring its origins, rules, recursive logic, and detailed code example, complete with step-by-step explanations and visual illustrations that guide you through solving the problem efficiently.
AlgorithmGoProgramming Tutorial
0 likes · 10 min read

This article walks through a Python coding challenge that sums numbers in a list while ignoring sections that start with 6 and end with the next 9, presenting five distinct solutions—including flag‑based, loop‑based, and recursive approaches—complete with explanations and full code examples.
AlgorithmListPython
0 likes · 7 min read

This article demonstrates how to write a Python program that recursively searches a specified directory for files of a given extension (e.g., PNG), moves the found files to a target directory, and later adapts the script to accept command‑line parameters for flexible execution.
command-linefile searchfile-move
0 likes · 5 min read

This article demonstrates how to retrieve flat menu data from a database into a List, then use Java 8 Stream operations and recursive methods to assemble a hierarchical tree structure, printing the result as JSON for verification.
BackendJavaTree Structure
0 likes · 4 min read


ByteFESep 14, 2021 · Frontend Development
This article explains the mathematical foundations of fractals, demonstrates how to use Canvas coordinate transformations and vector operations, and provides complete JavaScript code for drawing classic fractals such as the Koch snowflake, hexagonal snowflake, and a binary tree using recursive algorithms.
GraphicsJavaScriptfractals
0 likes · 14 min read

This article presents a classic river‑crossing puzzle where three people and three ghosts must use a two‑seat boat without ever letting ghosts outnumber people on either bank, detailing the analysis, each crossing round, and the logical search strategy to solve it.
Algorithmpuzzlerecursion
0 likes · 7 min read

This article explains functional programming concepts in Python, contrasting imperative and functional models, and demonstrates key techniques such as recursion, laziness, map, filter, reduce, lambda expressions, higher‑order functions, partial application, and comprehensions with clear code examples.
filterhigher-order functionslambda
0 likes · 15 min read

This article explains the fundamental concept of recursion using a cinema‑seat analogy, demonstrates array‑sum and Fibonacci implementations in JavaScript, shows how to visualize recursive calls, discusses stack‑overflow and redundant computation issues, and presents iterative and memoized alternatives.
AlgorithmStack Overflowmemoization
0 likes · 10 min read

This article walks through the classic “pick‑from‑both‑ends” apple game, analyzing why greedy choices fail, and presents recursive, memoized, and dynamic‑programming solutions in Go, complete with code examples and step‑by‑step explanations to help you determine the winning strategy.
Algorithmdynamic programminggame theory
0 likes · 8 min read

This article explains the differences between local and global variables in Python, how to modify globals with the global keyword, the behavior of mutable and immutable objects, demonstrates variable scope with code examples, and also covers references, lambda anonymous functions, and recursive implementations such as factorial calculations.
PythonVariable Scopelambda
0 likes · 6 min read

This comprehensive guide explores core algorithmic strategies for finding optimal solutions—including recursion, greedy methods, divide-and-conquer, dynamic programming, backtracking, and branch-and-bound—explaining their principles, use-cases, and providing concrete Java and C++ code examples to illustrate implementation details.
AlgorithmsDivide and Conquerbacktracking
0 likes · 54 min read

This article explains Python's local and global variables, how to modify globals within functions, demonstrates variable referencing, introduces anonymous lambda functions, and illustrates recursion with factorial examples, providing code snippets for each concept.
lambdaprogramming fundamentalsrecursion
0 likes · 6 min read

This article shares a generic Java utility class that recursively constructs hierarchical tree structures from a flat list by using functional interfaces to identify parent‑child relationships, optionally sorting nodes, and providing a flexible way to set child collections.
GenericsJavaTree Structure
0 likes · 4 min read

This article explains recursive functions, their call mechanics, and demonstrates Python examples for calculating factorials and Fibonacci numbers, highlighting advantages, stack‑overflow risks, and the lack of tail‑recursion optimization in the standard interpreter.
AlgorithmFibonacciPython
0 likes · 5 min read


ITPUBMar 25, 2021 · Fundamentals
The article traces the evolution from primitive CPU operations expressed as binary switches, through the birth of assembly language and low‑level patterns, to the abstraction of recursion, syntax trees, and compilers that translate human‑readable code into machine instructions.
Compilerassemblyfundamentals
0 likes · 11 min read

This article explains the core concepts of recursion by walking through an array‑sum example and a LeetCode linked‑list removal problem, detailing the necessary base case, recursive formula, and providing complete Java implementations with step‑by‑step visual illustrations.
AlgorithmJavaLeetCode
0 likes · 10 min read

The PHP count() function returns the number of elements in an array or the number of properties in an object, with an optional recursive mode for multidimensional arrays, and includes details on its signature, parameters, return values, and practical code examples.
COUNTFunctionObject
0 likes · 3 min read

This article explains the PHP function array_walk_recursive(), detailing its purpose, parameters, return values, and providing a complete example that demonstrates how to recursively apply a callback to array elements, including nested arrays, and shows the resulting output.
BackendCallbackPHP
0 likes · 2 min read

This article introduces recursion, explains its core principles, presents a general problem‑solving approach, and walks through multiple practical examples—from factorial and climbing stairs to binary tree inversion and the Tower of Hanoi—while analyzing time and space complexities and offering optimization techniques.
AlgorithmDivide and ConquerJava
0 likes · 23 min read

The article explains how PHP's array_merge_recursive() function combines multiple arrays by recursively merging values with identical keys, describes its parameters and return value, and provides a complete code example with expected output.
BackendPHParray_merge_recursive
0 likes · 2 min read

This article introduces the Fibonacci sequence, explains its definition, and presents six PHP implementations—including naive recursion, memoized recursion, bottom‑up iteration, iterative loop, closed‑form formula, and a lookup table—detailing their logic and performance considerations.
FibonacciPHPiteration
0 likes · 6 min read

This article provides a comprehensive guide to Python anonymous (lambda) functions, covering their syntax, execution order, recursion, and practical uses with map, filter, and reduce, while also explaining variable scopes, returning functions, and common pitfalls.
anonymous-functionsfilterlambda
0 likes · 8 min read

This article explains the two key properties of recursive functions, demonstrates Python's default recursion depth limit and how to adjust it, discusses the drawbacks of recursion, and presents a programming task to implement a recursive Fibonacci‑triangle generator with sample code.
AlgorithmFibonacciPython
0 likes · 3 min read

This article explains how to transform a number like 1234 into a reversed list of its digits using both a straightforward string method and two recursive implementations—standard and tail recursion—while noting Python's general preference for iterative solutions.
AlgorithmListrecursion
0 likes · 2 min read

This article explains how to enumerate every permutation of an array using a depth‑first search backtracking algorithm, illustrates the process with a tree diagram, compares DFS with BFS, and provides a complete C implementation along with a generic Python template.
AlgorithmC++DFS
0 likes · 7 min read


JavaEdgeJan 3, 2020 · Interview Experience
This article explains how to determine whether a binary tree contains a root‑to‑leaf path whose node values sum to a given target, outlines the recursive subtraction method, and provides a complete C implementation of the algorithm.
AlgorithmInterviewbinary tree
0 likes · 2 min read

This article explains the divide‑and‑conquer principle behind quick sort, walks through a concise Python version and a more classic C‑style implementation, analyzes their inefficiencies, and offers practical optimization tips such as better pivot selection, space reduction, and hybrid sorting strategies.
AlgorithmDivide and ConquerQuick Sort
0 likes · 9 min read

This article explains the concept of recursion, presents a universal four‑step solving method, and walks through multiple practical examples—from factorials and frog‑jump problems to binary‑tree inversion, Tower of Hanoi, and cellular division—while detailing time and space complexity analyses and optimization strategies.
binary treedynamic programmingrecursion
0 likes · 22 min read

The article treats functions as pure data‑to‑data mappings and demonstrates how common mathematical operations such as factorial, exponentiation, and Fibonacci can be expressed in TypeScript/JavaScript using recursive, tail‑recursive, iterative, and logarithmic‑time algorithms that illustrate functional transformation techniques and efficient algorithm design.
AlgorithmFibonacciexponentiation
0 likes · 8 min read

The article explains how to generate prime numbers with a recursive filtering method, identify twin primes below 10,000, and includes Java implementations of bubble sort and insertion sort, along with a brief commentary on Groovy's advantages and a curated list of related technical articles.
AlgorithmJavaPrime Numbers
0 likes · 5 min read

This article explains the symmetric‑tree problem, outlines a depth‑first recursive strategy with base‑case checks, demonstrates short‑circuit evaluation, analyzes time complexity, and provides a complete Java implementation that determines tree symmetry in linear time.
AlgorithmDFSJava
0 likes · 3 min read

The article explains how to solve a variant of the linked‑list reversal problem where every K nodes are reversed as a group starting from the tail, using recursion and double reversal techniques, and provides complete Java implementations for the algorithm.
Algorithmk-group reversallinked list
0 likes · 7 min read

This article introduces recursion by outlining its three essential elements—function purpose, base case, and recurrence relation—and demonstrates each step with clear Java/C examples such as factorial, Fibonacci, frog‑jump, and linked‑list reversal, while also covering common pitfalls and optimization techniques.
AlgorithmC++coding
0 likes · 15 min read

This comprehensive guide explains Python functions—their purpose, definition syntax, scope rules, built‑in statements like def, return, global, nonlocal, and lambda, various argument types, recursion, higher‑order functions, and functional tools such as map, filter, and reduce—complete with runnable code examples.
argumentsfunctionshigher-order
0 likes · 20 min read

This article introduces several practical algorithmic tricks—using array indices as counters, applying modulo for circular traversal, employing two‑pointer methods for linked‑list problems, leveraging bit‑shift and bitwise operations, adding sentinel nodes, and optimizing recursive solutions with memoization and bottom‑up DP—each illustrated with Java code examples.
Algorithmcoding tricksdata structures
0 likes · 10 min read

This article introduces core Go concepts—including slice internals, common pitfalls when using slices and maps, type conversion techniques, function parameter behavior, and a stack‑overflow‑safe directory‑listing example—providing practical code snippets and guidance for reliable Go development.
ConcurrencyGoType Conversion
0 likes · 9 min read

This article introduces the depth‑first search algorithm for web crawling, explains how URLs are structured, shows the traversal order using a binary‑tree analogy, provides a recursive implementation example, warns about stack overflow, and hints at an upcoming breadth‑first search tutorial.
Algorithmdata-structuresdepth-first-search
0 likes · 7 min read

The article explains why automated JSON comparison is needed in testing, introduces the json_tools library and a custom recursive approach for detecting differences, shows example outputs, explains the change descriptors, and compares the pros and cons of each method.
JSONJSON DiffPython
0 likes · 3 min read


21CTOSep 17, 2018 · Fundamentals
This article explains how recursion works in Python, demonstrates factorial and list‑flattening implementations, shows how to check and adjust the language's recursion limit, and warns about infinite recursion errors with clear code samples.
Code ExamplesPythonfactorial
0 likes · 5 min read


21CTOAug 27, 2018 · Fundamentals
Memoization, a dynamic programming technique introduced in 1968, stores results of recursive calls to eliminate redundant calculations, dramatically improving performance—as demonstrated by transforming a naïve O(2ⁿ) Fibonacci function into an O(n) version with simple code modifications and practical examples.
Fibonaccialgorithm optimizationdynamic programming
0 likes · 5 min read

This article provides a comprehensive guide to Python functions, covering basic definitions, various parameter types—including default, positional, keyword, variable arguments and keyword‑only parameters—common pitfalls, recursion, lambda expressions, and best practices for clean, reusable code.
ParametersPythondefault-arguments
0 likes · 14 min read

This article explains Java 8 lambda expressions, their syntax, how to use streams with map, filter, and reduce operations, defines functional interfaces, and demonstrates advanced recursive lambda techniques such as the Y combinator, all with clear code examples.
Functional InterfaceJava8recursion
0 likes · 7 min read

This article explores how to implement recursive and non‑recursive DOM tree searches, hash‑based lookups, and several classic sorting algorithms—including quick sort and merge sort—in JavaScript, discussing their time and space complexities, stability considerations, and practical performance tips for front‑end development.
AlgorithmDOMfrontend
0 likes · 20 min read

This article explains how to use a Python implementation of the minimax algorithm to analyze a Doudizhu end‑game scenario, detailing the core logic, recursive hand simulation, caching optimizations, and the final result that the farmer side has no guaranteed winning strategy.
AlgorithmDoudizhuMiniMax
0 likes · 6 min read


21CTOSep 1, 2015 · Fundamentals
This article curates a list of ten science‑fiction and thriller movies, each illustrating fundamental programming ideas such as recursion, loops, reentrancy, virtual machines, AI, and parallelism, helping developers see code concepts come alive on screen.
AImoviesprogramming
0 likes · 12 min read

This article explains the backtracking algorithm as an enumeration‑like depth‑first search technique, outlines its fundamental concepts, basic ideas, typical problem‑solving steps, and provides both non‑recursive and recursive pseudo‑code frameworks for implementation.
Algorithmbacktrackingdepth-first-search
0 likes · 4 min read

This article explains the divide-and-conquer algorithmic technique, covering its basic concepts, design strategy, three-step recursive process, complexity analysis, and a list of classic problems that can be efficiently solved using this method.
Complexity AnalysisDivide and Conqueralgorithm design
0 likes · 7 min read
