Update README.md

Author: A-Georgiou

README.md

@@ -1,10 +1,113 @@
-# Algorithm Visualiser
+# Algorithm Visualizer
 
-Initialised with React + Vite.
-Providing visual representation for common algorithms found in Computer Science for students / learning.
+Welcome to the **Algorithm Visualizer** project! This tool is designed to provide visual representations of various common algorithms in Computer Science, making it easier for students and learners to understand and interact with these fundamental concepts.
 
-Currently implemented algorithms:
-    - Bubble Sort
-    - Quick Sort
+### Initialised with React + Vite
+The project is built using [React](https://reactjs.org/) and [Vite](https://vitejs.dev/), ensuring a fast and responsive user experience.
 
-### Hosted on GitHub Pages at: https://a-georgiou.github.io/Algorithm-Visualiser/
+## Features
+
+### Sorting Algorithms
+1. **Bubble Sort**: Watch as the simplest sorting algorithm compares and swaps elements to sort the array.
+2. **Quick Sort**: See the divide-and-conquer approach in action, partitioning arrays and recursively sorting the partitions.
+
+### Search Algorithms (Coming Soon)
+- **Linear Search**
+- **Binary Search**
+
+### Pathfinding Algorithms
+1. **Dijkstra's Algorithm**: Visualize the shortest path between nodes in a graph, ensuring the most efficient route.
+2. **A* Algorithm**: Experience a more advanced pathfinding algorithm that uses heuristics to optimize the search.
+3. **Breadth-First Search (BFS)**: Explore the graph level by level.
+4. **Depth-First Search (DFS)**: Dive deep into the graph to find a path.
+
+### Maze Generation Algorithms
+- **Recursive Division**
+- **Randomized Prim's Algorithm**
+- **Randomized Kruskal's Algorithm**
+
+### Graph Algorithms (Coming Soon)
+- **Minimum Spanning Tree (Prim's and Kruskal's)**
+- **Topological Sort**
+
+## Getting Started
+
+To get a local copy up and running, follow these steps:
+
+### Prerequisites
+- [Node.js](https://nodejs.org/) (Version 14.x or later)
+- [npm](https://www.npmjs.com/) or [yarn](https://yarnpkg.com/)
+
+### Installation
+1. Clone the repo:
+   ```sh
+   git clone https://github.com/a-georgiou/Algorithm-Visualiser.git
+   ```
+2. Navigate to the project directory:
+   ```sh
+   cd Algorithm-Visualiser
+   ```
+3. Install dependencies:
+   ```sh
+   npm install
+   ```
+   or
+   ```sh
+   yarn install
+   ```
+
+### Running the Project
+1. Start the development server:
+   ```sh
+   npm run dev
+   ```
+   or
+   ```sh
+   yarn dev
+   ```
+2. Open your browser and navigate to `http://localhost:3000`
+
+### Building for Production
+1. Build the project:
+   ```sh
+   npm run build
+   ```
+   or
+   ```sh
+   yarn build
+   ```
+2. Serve the build output:
+   ```sh
+   npm run serve
+   ```
+   or
+   ```sh
+   yarn serve
+   ```
+
+## Usage
+
+Navigate through the UI to select different algorithms. Adjust parameters as needed and watch the visual representation update in real-time.
+
+## Contributing
+
+Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are **greatly appreciated**.
+
+1. Fork the Project
+2. Create your Feature Branch (`git checkout -b feature/AmazingFeature`)
+3. Commit your Changes (`git commit -m 'Add some AmazingFeature'`)
+4. Push to the Branch (`git push origin feature/AmazingFeature`)
+5. Open a Pull Request
+
+## License
+
+Distributed under the MIT License. See `LICENSE` for more information.
+
+## Contact
+
+Andrew Georgiou - Email: [email protected] LinkedIn
+
+Project Link: [https://github.com/a-georgiou/Algorithm-Visualiser](https://github.com/a-georgiou/Algorithm-Visualiser)
+
+### Hosted on GitHub Pages
+Check out the live version of the project [here](https://a-georgiou.github.io/Algorithm-Visualiser/).