Skip to content

Latest commit

 

History

History
119 lines (84 loc) · 2.37 KB

README.md

File metadata and controls

119 lines (84 loc) · 2.37 KB

Java Algorithms and Data Structures

This repository contains implementations of various algorithms and data structures in Java. It is intended as a resource for learning and reference.

Table of Contents

Introduction

This repository is a collection of algorithms and data structures implemented in Java. Each algorithm and data structure has its own folder containing the Java code and a README file explaining the implementation and usage.

Algorithms

Sorting Algorithms

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Heap Sort

Searching Algorithms

  • Linear Search
  • Binary Search

Graph Algorithms

  • Depth-First Search (DFS)
  • Breadth-First Search (BFS)
  • Dijkstra's Algorithm
  • A* Search Algorithm

Dynamic Programming

  • Fibonacci Sequence
  • Knapsack Problem

Data Structures

Arrays

Implementation and usage of arrays.

Linked Lists

  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List

Stacks

Implementation and usage of stacks.

Queues

  • Simple Queue
  • Circular Queue
  • Priority Queue

Trees

  • Binary Tree
  • Binary Search Tree
  • AVL Tree
  • Red-Black Tree
  • B-Tree

Graphs

Implementation and usage of graphs.

Installation

  1. Clone the repository:
    git clone https://github.com/bcExpt1123/java-alda.git
  2. Navigate to the project directory:
    cd java-alda

Usage

Each algorithm and data structure has its own folder. Navigate to the folder of the algorithm or data structure you want to use and compile the Java file:

javac FileName.java

Run the compiled Java file:

java FileName

Contributing

Contributions are welcome! Please read the contributing guidelines for more details.

License

This project is licensed under the MIT License. See the LICENSE file for details.