|
1 | | -# Java Algorithm And Data Structure |
| 1 | +# Java Algorithms and Data Structures |
| 2 | + |
| 3 | +This repository contains implementations of various algorithms and data structures in Java. It is intended as a resource for learning and reference. |
| 4 | + |
| 5 | +## Table of Contents |
| 6 | + |
| 7 | +- [Introduction](#introduction) |
| 8 | +- [Algorithms](#algorithms) |
| 9 | + - [Sorting Algorithms](#sorting-algorithms) |
| 10 | + - [Searching Algorithms](#searching-algorithms) |
| 11 | + - [Graph Algorithms](#graph-algorithms) |
| 12 | + - [Dynamic Programming](#dynamic-programming) |
| 13 | +- [Data Structures](#data-structures) |
| 14 | + - [Arrays](#arrays) |
| 15 | + - [Linked Lists](#linked-lists) |
| 16 | + - [Stacks](#stacks) |
| 17 | + - [Queues](#queues) |
| 18 | + - [Trees](#trees) |
| 19 | + - [Graphs](#graphs) |
| 20 | +- [Installation](#installation) |
| 21 | +- [Usage](#usage) |
| 22 | +- [Contributing](#contributing) |
| 23 | +- [License](#license) |
| 24 | + |
| 25 | +## Introduction |
| 26 | + |
| 27 | +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. |
| 28 | + |
| 29 | +## Algorithms |
| 30 | + |
| 31 | +### Sorting Algorithms |
| 32 | + |
| 33 | +- Bubble Sort |
| 34 | +- Selection Sort |
| 35 | +- Insertion Sort |
| 36 | +- Merge Sort |
| 37 | +- Quick Sort |
| 38 | +- Heap Sort |
| 39 | + |
| 40 | +### Searching Algorithms |
| 41 | + |
| 42 | +- Linear Search |
| 43 | +- Binary Search |
| 44 | + |
| 45 | +### Graph Algorithms |
| 46 | + |
| 47 | +- Depth-First Search (DFS) |
| 48 | +- Breadth-First Search (BFS) |
| 49 | +- Dijkstra's Algorithm |
| 50 | +- A* Search Algorithm |
| 51 | + |
| 52 | +### Dynamic Programming |
| 53 | + |
| 54 | +- Fibonacci Sequence |
| 55 | +- Knapsack Problem |
| 56 | + |
| 57 | +## Data Structures |
| 58 | + |
| 59 | +### Arrays |
| 60 | + |
| 61 | +Implementation and usage of arrays. |
| 62 | + |
| 63 | +### Linked Lists |
| 64 | + |
| 65 | +- Singly Linked List |
| 66 | +- Doubly Linked List |
| 67 | +- Circular Linked List |
| 68 | + |
| 69 | +### Stacks |
| 70 | + |
| 71 | +Implementation and usage of stacks. |
| 72 | + |
| 73 | +### Queues |
| 74 | + |
| 75 | +- Simple Queue |
| 76 | +- Circular Queue |
| 77 | +- Priority Queue |
| 78 | + |
| 79 | +### Trees |
| 80 | + |
| 81 | +- Binary Tree |
| 82 | +- Binary Search Tree |
| 83 | +- AVL Tree |
| 84 | +- Red-Black Tree |
| 85 | +- B-Tree |
| 86 | + |
| 87 | +### Graphs |
| 88 | + |
| 89 | +Implementation and usage of graphs. |
| 90 | + |
| 91 | +## Installation |
| 92 | + |
| 93 | +1. Clone the repository: |
| 94 | + ```sh |
| 95 | + git clone https://github.com/bcExpt1123/java-alda.git |
| 96 | + ``` |
| 97 | +2. Navigate to the project directory: |
| 98 | + ```sh |
| 99 | + cd java-alda |
| 100 | + ``` |
| 101 | + |
| 102 | +## Usage |
| 103 | + |
| 104 | +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: |
| 105 | +```sh |
| 106 | +javac FileName.java |
| 107 | +``` |
| 108 | +Run the compiled Java file: |
| 109 | +```sh |
| 110 | +java FileName |
| 111 | +``` |
| 112 | + |
| 113 | +## Contributing |
| 114 | + |
| 115 | +Contributions are welcome! Please read the [contributing guidelines](CONTRIBUTING.md) for more details. |
| 116 | + |
| 117 | +## License |
| 118 | + |
| 119 | +This project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details. |
0 commit comments