big O | BestHub

Rare Earth Juejin Tech Community

Oct 14, 2021 · Fundamentals

Introduction to Data Structures and Algorithms: Basics, Sorting, and Advanced Structures

This article introduces the fundamentals of data structures and algorithms, covering basic structures such as arrays and linked lists, common sorting algorithms, advanced structures like B+ trees and red‑black trees, explains Big O notation, and provides Java code examples for dynamic arrays, linked lists, queues, and stacks.

JavaLinked Listalgorithms

0 likes · 15 min read

Introduction to Data Structures and Algorithms: Basics, Sorting, and Advanced Structures

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

Sohu Tech Products

Oct 14, 2020 · Fundamentals

Understanding JavaScript Arrays and Objects: Operations and Big O Complexity

This article explains when to use JavaScript arrays versus objects by describing their memory layout, common operations such as adding, removing, and searching elements, and analyzing each operation's time complexity using Big O notation, while also covering hash collisions and practical performance considerations.

JavaScriptarraysbig O

0 likes · 12 min read

Understanding JavaScript Arrays and Objects: Operations and Big O Complexity