BestHub
Sign in
Tagged articles
23 articles
Page 1 of 1
Liangxu Linux
Liangxu Linux
Nov 11, 2025 · Fundamentals

How to Classify C Functions for Cleaner Code and Better Optimization

This article explains three practical categories for C functions—pure functions with no side effects, functions that read external state without modifying it, and functions that both read and depend on external variables—showing how the classification aids memoization, re‑entrancy reasoning, and inline‑function usage.

C programmingPure Functionsfunction classification
0 likes · 5 min read
How to Classify C Functions for Cleaner Code and Better Optimization
Code Mala Tang
Code Mala Tang
Jun 3, 2025 · Fundamentals

10 Essential Python Design Patterns Every Developer Should Master

Explore ten crucial Python design patterns—from Singleton to Memoization—complete with real-world examples for data pipelines, ETL processes, and scalable systems, helping developers write cleaner, more maintainable, and efficient code across backend and data engineering tasks.

Backend DevelopmentCode ReusabilityDesign Patterns
0 likes · 9 min read
10 Essential Python Design Patterns Every Developer Should Master
Test Development Learning Exchange
Test Development Learning Exchange
Dec 3, 2024 · Fundamentals

10 Essential Python Recursion Techniques for Efficient and Safe Coding

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.

Recursionmemoizationtail-recursion
0 likes · 7 min read
10 Essential Python Recursion Techniques for Efficient and Safe Coding
Top Architecture Tech Stack
Top Architecture Tech Stack
Feb 5, 2024 · Fundamentals

Simple Techniques to Speed Up Python For Loops by 1.3× to 970×

This article presents a collection of straightforward Python techniques—such as list comprehensions, external length calculation, set usage, early‑exit loops, inlining functions, pre‑computations, generators, map(), memoization, NumPy vectorization, filterfalse, and join()—that can accelerate for‑loops anywhere from 1.3‑fold up to nearly a thousand‑fold, with explanations and benchmark results.

GeneratorsLoop OptimizationNumPy
0 likes · 18 min read
Simple Techniques to Speed Up Python For Loops by 1.3× to 970×
Python Programming Learning Circle
Python Programming Learning Circle
Jan 4, 2024 · Fundamentals

Simple Methods to Speed Up Python For Loops (1.3× to 970×)

This article presents a series of practical techniques—such as list comprehensions, pre‑computing lengths, using sets, skipping irrelevant iterations, inlining functions, generators, map, memoization, vectorization, and efficient string joining—that can accelerate Python for‑loops anywhere from 1.3‑fold up to 970‑fold, with concrete benchmark results and code examples.

Loop OptimizationPythonmemoization
0 likes · 15 min read
Simple Methods to Speed Up Python For Loops (1.3× to 970×)
KooFE Frontend Team
KooFE Frontend Team
Sep 18, 2022 · Frontend Development

PureComponent vs Hooks: Mastering React Re‑renders and Performance

This article explores how PureComponent and shouldComponentUpdate address unnecessary re‑renders in class components, compares them with functional components and hooks, and provides practical techniques—including React.memo, useCallback, setState updater functions, and refs—to optimize rendering performance in modern React applications.

PureComponentReacthooks
0 likes · 20 min read
PureComponent vs Hooks: Mastering React Re‑renders and Performance
Architect's Journey
Architect's Journey
May 12, 2022 · Fundamentals

Dynamic Programming Made Simple: Divide‑and‑Conquer and Redundancy Elimination

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.

RecursionSoftware Engineeringalgorithm fundamentals
0 likes · 6 min read
Dynamic Programming Made Simple: Divide‑and‑Conquer and Redundancy Elimination
Alipay Experience Technology
Alipay Experience Technology
Apr 11, 2022 · Frontend Development

Boost React App Performance: 4 Proven Optimization Techniques

This article outlines four key React performance optimization strategies—reducing render frequency, trimming rendered nodes, minimizing computation, and designing components wisely—while providing practical code examples such as PureComponent, shouldComponentUpdate, React.memo, lazy loading, useMemo, and virtualized lists.

LazyLoadingReactVirtualList
0 likes · 12 min read
Boost React App Performance: 4 Proven Optimization Techniques
DaTaobao Tech
DaTaobao Tech
Feb 18, 2022 · Frontend Development

Optimizing UI Rendering Performance in OpenSumi IDE

The article shows how OpenSumi’s UI lag, caused by global‑state re‑renders, redundant props, and repeated menu and tree creation, can be eliminated by memoizing components, splitting views, caching menus, removing unneeded width props, batching icon CSS insertion, and debouncing ResizeObserver events, cutting latency from seconds to smooth responsiveness on both M1 and Intel machines.

IDEOpenSumiPerformance Optimization
0 likes · 13 min read
Optimizing UI Rendering Performance in OpenSumi IDE
政采云技术
政采云技术
Sep 15, 2021 · Frontend Development

Using React Profiler for Performance Analysis and Optimization

This article explains how to install and use the React Profiler tool to identify performance bottlenecks in React applications, demonstrates analysis of render phases with example code, and discusses optimization techniques such as React.memo, PureComponent, shouldComponentUpdate, and hooks to reduce unnecessary re‑renders.

Reacthooksmemoization
0 likes · 12 min read
Using React Profiler for Performance Analysis and Optimization
php Courses
php Courses
Nov 4, 2020 · Fundamentals

Various Methods to Compute the Nth Fibonacci Number in PHP

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.

FibonacciPHPRecursion
0 likes · 6 min read
Various Methods to Compute the Nth Fibonacci Number in PHP
Python Programming Learning Circle
Python Programming Learning Circle
Nov 2, 2019 · Fundamentals

Taming Left Recursion in PEG Parsers: A Practical Guide

This article explains why left‑recursive rules break recursive‑descent parsers, demonstrates how naïve grammar rewrites alter parse trees, and introduces an oracle‑based memoization technique with a custom @memoize_left_rec decorator to correctly handle left recursion in PEG parsers.

Compiler TheoryPEGPython
0 likes · 13 min read
Taming Left Recursion in PEG Parsers: A Practical Guide
UC Tech Team
UC Tech Team
Oct 24, 2018 · Frontend Development

React v16.6.0 Release: New Features such as React.memo, React.lazy, Context API Enhancements, Error Boundaries, and StrictMode Updates

On October 23, React 16.6.0 was released, introducing React.memo for function components, React.lazy with Suspense for code‑splitting, a simpler static contextType API, new error‑boundary methods, and deprecations in StrictMode, along with installation instructions and a detailed changelog.

Error HandlingJavaScriptReact
0 likes · 7 min read
React v16.6.0 Release: New Features such as React.memo, React.lazy, Context API Enhancements, Error Boundaries, and StrictMode Updates
21CTO
21CTO
Aug 27, 2018 · Fundamentals

Boost Recursive Algorithms with Memoization: A Practical Guide

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.

Algorithm OptimizationFibonacciRecursion
0 likes · 5 min read
Boost Recursive Algorithms with Memoization: A Practical Guide
21CTO
21CTO
Oct 22, 2017 · Frontend Development

Mastering React: From Transformation to Algebraic Effects

This article walks front‑end developers through the author's deductive model of React, covering transformation, abstraction, composition, state handling, memoization, list management, continuations, state maps, and algebraic effects with clear code examples.

Component ArchitectureJavaScriptReact
0 likes · 9 min read
Mastering React: From Transformation to Algebraic Effects