The Baeldung logo
  • The Baeldung Logo
  • Start Here
  • About ▼▲

    • Full Archive

      The high level overview of all the articles on the site.

    • Write for Baeldung

      Become a writer on the site.

    • About Baeldung

      About Baeldung.

Algorithms

Algorithms are one of the foundational concepts in programming.

We’re exploring the basics of Computer Science here, and a lot more here, on the Java side.

  • Binary Tree (16)
  • Array (11)
  • Dijkstra (9)
  • Linked List (5)
  • NP-Complete (3)

>> Count the Number of Set Bits in an Integer

>> Depth-First Search vs. Breadth-First Search

>> Graph Search vs. Tree-Like Search

>> Uniform-Cost Search vs. Best-First Search

>> The Informed Vs. Uninformed Search Algorithms

>> Finding All Tic-Tac-Toe Winning Combinations

>> Tracing the Path in DFS, BFS, and Dijkstra’s Algorithm

>> Beam Search Algorithm

>> Iterative Deepening vs. Depth-First Search

>> An Algorithm for Inflating and Deflating Polygons

  • ← Previous
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • Next →
  • »
The Baeldung logo

Categories

  • Algorithms
  • Artificial Intelligence
  • Core Concepts
  • Data Structures
  • Graph Theory
  • Latex
  • Networking
  • Security

Series

  • Drawing Charts in Latex

About

  • About Baeldung
  • The Full archive
  • Write for Baeldung
  • Editors
  • Terms of Service
  • Privacy Policy
  • Company Info
  • Contact
The Baeldung Logo