README.md

Data Structures and Algorithms in Java

link and credits for the image above: www.geeksforgeeks.org, their great article

Definitions of Algorithms:

• https://en.wikipedia.org/wiki/Algorithm
• https://www.geeksforgeeks.org/fundamentals-of-algorithms/

Definitions of Data Structure:

• https://en.wikipedia.org/wiki/Data_structure
• https://www.geeksforgeeks.org/data-structures/

Algorithms

• Recursion
• Sorting
  • Bubble Sort (stable sort)
  • Selection Sort (unstable sort)
  • Insertion Sort (stable sort)
  • Shell Sort (unstable sort)
  • Merge Sort (stable sort)
  • Quick Sort (unstable sort)
  • Counting Sort (stable sort)
  • Radix Sort (stable sort)
  • Bucket Sort
  • Heapsort
• Searching
  • Linear Search
  • Binary Search
  • Binary Search Trees

Data Structures

• Arrays
• ArrayLists
• Vectors
• Linked Lists
  • Singly Linked Lists
  • Doubly Linked Lists
• Stacks
• Queues
  • Array Queue
  • Circular Queue
• Hashtables
  • Array Hashtable
  • Linear Probing
  • Chaining
• Trees
• Heaps

Java Data Structures and Algorithms

Description

This Java project provides a collection of common data structures and algorithms implemented in Java. It is designed to be a helpful resource for learning and practicing algorithms and data structures.

Features

• Comprehensive set of data structures including arrays, linked lists, stacks, queues, trees, and graphs.
• Efficient implementations of popular algorithms such as sorting, searching, and graph traversal.
• Well-documented code with detailed explanations of each data structure and algorithm.

Installation

1. Clone the repository:

   git clone https://github.com/all-an/dsa-java.git

2. Navigate to the project directory:

   open on ide Intellij

Contributing

Contributions are welcome! If you find any issues or want to add new features, please submit a pull request. Make sure to follow the established coding guidelines and write appropriate unit tests for your changes.

License

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