• Skip to primary navigation
  • Skip to content
  • Skip to footer
Leo Werneck Data Structures & Algorithms
  • Home
  • Publications
  • Talks
  • Teaching
  • Resume/CV
    • 1 Getting Started
      • 1.1 Introduction
      • 1.2 Big O Notation
    • 2 Data Structures
      • 2.1 Static Arrays
      • 2.2 Dynamic Arrays
      • 2.3 Linked List
      • 2.4 Stack
      • 2.5 Queue
      • 2.6 Priority Queue
      • 2.7 Hash Table
    • 3 Algorithms
      • 3.1 Sorting Algorithms
        • 3.1.1 Bubble Sort
        • 3.1.2 Insertion Sort
        • 3.1.3 Quicksort
        • 3.1.4 Merge Sort
        • 3.1.5 Introsort
        • 3.1.6 Timsort
      • 3.2 Searching Algorithms
        • 3.2.1 Binary Search

    Array List

    less than 1 minute read

    On this page

    In progress.

    Updated: October 10, 2025

    Previous Next
    • Follow:
    © 2025 Leo Werneck. Powered by Jekyll & Minimal Mistakes.