{"id":19053350,"url":"https://github.com/georgiosioannoucoder/division-algorithms","last_synced_at":"2025-02-22T01:16:19.829Z","repository":{"id":217381636,"uuid":"743738313","full_name":"GeorgiosIoannouCoder/division-algorithms","owner":"GeorgiosIoannouCoder","description":"Analysis and Implementation of Common Division Algorithms. ➗","archived":false,"fork":false,"pushed_at":"2024-01-17T09:57:29.000Z","size":4896,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-02T10:45:39.278Z","etag":null,"topics":["division","extended-synthetic-division","fast-division","goldshmidt","goldshmidt-algorithm","goldshmidt-division","long-division","naive-division","newton-raphson","newton-raphson-algorithm","newton-raphson-division","non-restoring-division","polynomial-long-division","polynomials","restoring-division","slow-division","srt-division","unsigned-integers"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GeorgiosIoannouCoder.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-15T22:00:35.000Z","updated_at":"2024-07-16T04:27:54.000Z","dependencies_parsed_at":"2024-01-16T03:27:07.845Z","dependency_job_id":"7e76850b-4b9b-4498-a6f2-a9a6c9053de0","html_url":"https://github.com/GeorgiosIoannouCoder/division-algorithms","commit_stats":null,"previous_names":["georgiosioannoucoder/division-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GeorgiosIoannouCoder%2Fdivision-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GeorgiosIoannouCoder%2Fdivision-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GeorgiosIoannouCoder%2Fdivision-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GeorgiosIoannouCoder%2Fdivision-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GeorgiosIoannouCoder","download_url":"https://codeload.github.com/GeorgiosIoannouCoder/division-algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240109714,"owners_count":19749181,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["division","extended-synthetic-division","fast-division","goldshmidt","goldshmidt-algorithm","goldshmidt-division","long-division","naive-division","newton-raphson","newton-raphson-algorithm","newton-raphson-division","non-restoring-division","polynomial-long-division","polynomials","restoring-division","slow-division","srt-division","unsigned-integers"],"created_at":"2024-11-08T23:30:15.079Z","updated_at":"2025-02-22T01:16:19.810Z","avatar_url":"https://github.com/GeorgiosIoannouCoder.png","language":"Jupyter Notebook","readme":"# Revolutionizing the Division Operation | Analysis and Implementation of Common Division Algorithms\n\u003ca name=\"readme-top\"\u003e\u003c/a\u003e\n\n[![Contributors][contributors-shield]][contributors-url]\n[![Forks][forks-shield]][forks-url]\n[![Stargazers][stars-shield]][stars-url]\n[![Issues][issues-shield]][issues-url]\n[![MIT License][license-shield]][license-url]\n[![LinkedIn][linkedin-shield]][linkedin-url]\n[![GitHub][github-shield]][github-url]\n\n\u003cbr /\u003e\n\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"logo.png\" alt=\"Logo\"\u003e\n\n\u003ch3 align=\"center\"\u003e\u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf\"\u003eAnalysis and Implementation of Common Division Algorithms\u003c/a\u003e\u003c/h3\u003e\n\n  \u003cp align=\"center\"\u003e\n    Division is the most time-consuming, resource expensive, and complex arithmetic operation. Hardware and software support for floating-point arithmetic is a must in modern central processor units. Even though division is used the least compared to addition and multiplication, it is becoming increasingly important in modern complex applications. The performance of such applications is affected and limited by the algorithms used for division. This project and \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf\"\u003eReport\u003c/a\u003e study some of the most used division algorithms such as \u003cb\u003elong division, restoring, non-restoring, SRT, Newton-Raphson, Goldschmidt, accurate quotient approximations, polynomial long division, and polynomial extended synthetic division\u003c/b\u003e. \u003cb\u003eThe \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf\"\u003eReport\u003c/a\u003e continues by comparing the fastest division algorithm with Python’s built-in integer division, divmod function, and polydiv function\u003c/b\u003e. Finally, the \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf\"\u003eReport\u003c/a\u003e concludes that the \u003cb\u003eNewton-Raphson division algorithm is the fastest for integers, and the polynomial extended synthetic division algorithm is the fastest for polynomials.\u003c/b\u003e Moreover, the \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf\"\u003eReport\u003c/a\u003e illustrates that \u003cb\u003eNewton-Raphson division algorithm and polynomial extended synthetic division algorithm are faster and more efficient than Python’s built-in algorithms\u003c/b\u003e.\n    \u003cbr /\u003e\n    \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms\"\u003e\u003cstrong\u003eExplore the docs »\u003c/strong\u003e\u003c/a\u003e\n    \u003cbr /\u003e\n    \u003cbr /\u003e\n    \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/issues\"\u003eReport Bug\u003c/a\u003e\n    ·\n    \u003ca href=\"https://github.com/GeorgiosIoannouCoder/division-algorithms/issues\"\u003eRequest Feature\u003c/a\u003e\n  \u003c/p\u003e\n\u003c/div\u003e\n\n\u003cdetails\u003e\n  \u003csummary\u003eTable of Contents\u003c/summary\u003e\n  \u003col\u003e\n    \u003cli\u003e\n      \u003ca href=\"#about-the-project\"\u003eAbout The Project\u003c/a\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"#division-algorithms-for-this-project\"\u003eDivision Algorithms For This Project\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#key-features\"\u003eKey Features\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#built-with\"\u003eBuilt With\u003c/a\u003e\u003c/li\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n    \u003cli\u003e\n      \u003ca href=\"#getting-started\"\u003eGetting Started\u003c/a\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"#prerequisites\"\u003ePrerequisites\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#setup\"\u003eSetup\u003c/a\u003e\u003c/li\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#code\"\u003eCode\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#report\"\u003eReport\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#slides\"\u003eSlides\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#analysis-and-conclusions\"\u003eAnalysis and Conclusions\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#contributing\"\u003eContributing\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#license\"\u003eLicense\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#contact\"\u003eContact\u003c/a\u003e\u003c/li\u003e\n  \u003c/ol\u003e\n\u003c/details\u003e\n\n## About The Project\n\n\u003cimg src=\"logo.png\" alt=\"Logo\" width=\"100\" height=\"100\"\u003e\n\n### Division Algorithms For This Project\n\nDivision Alogirthms can be categorized into:\n\n**1. Division of unsigned integers**\n\n**2. Division of polynomials**\n\n\u003cimg src=\"./figures/Division_Algorithms_Diagram.png\" alt=\"Division Algorithms\"\u003e\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n\n### Key Features\n\n1. **Excessively test each Division Algorithm with the number of digits starting from 0 and going up to 2,097,153.**\n2. **Excessively test each Polynomial Division Algorithm with the degree of the polynomial starting from 5,000 and going up to 300,002.**\n3. **A new unique way of implementing [Newton Raphson Division Algorithm](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/figures/Newton_Raphson_Division_Algorithm/Newton_Raphson_Division_Algorithm_Code.png).**\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n### Built With\n\n[![Python][Python]][Python-url]\n[![JupyterNotebook][JupyterNotebook]][JupyterNotebook-url]\n[![Anaconda][Anaconda]][Anaconda-url]\n[![Pandas][Pandas]][Pandas-url]\n[![Matplotlib][Matplotlib]][Matplotlib-url]\n[![Git][Git]][Git-url]\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## Getting Started\n\n**To get a local copy of the Revolutionizing the Division Operation project up and running locally follow these simple example steps:**\n\n### Prerequisites\n\n**NOTE:** How to check if Python is installed and what is its version\n\n```sh\n  python --version\n```\n\n**NOTE:** How to check if Git is installed and what is its version\n\n```sh\n  git -v\n```\n\n1. Please make sure you have pyenv installed and use Python3 version 3.11.0:\n\n   - You can use pyenv to switch between different Python versions:\n     - Windows: [https://www.youtube.com/watch?v=HTx18uyyHw8](https://github.com/pyenv-win/pyenv-win)\n     - Mac: [https://www.youtube.com/watch?v=31WU0Dhw4sk](https://github.com/pyenv/pyenv)\n     - Linux: [https://www.youtube.com/watch?v=1Zgo8M9yUtM](https://github.com/pyenv/pyenv)\n\n2. Please make sure you have git installed\n\n   - Windows: [https://git-scm.com/download/win](https://git-scm.com/download/win)\n   - Mac: [https://git-scm.com/download/mac](https://git-scm.com/download/mac)\n   - Linux: [https://git-scm.com/download/linux](https://git-scm.com/download/linux)\n\n3. Please look at the [setup](https://github.com/GeorgiosIoannouCoder/division-algorithms/tree/main/setup) folder found in this project to find the directions specific to your operating system. The general instructions can also be found below.\n\n### Setup\n\n1. Navigate to the directory where you want to clone/run/save the application:\n\n   ```sh\n   cd your_selected_directory\n   ```\n\n2. Clone this repository:\n\n   ```sh\n   git clone https://github.com/GeorgiosIoannouCoder/division-algorithms.git\n   ```\n\n3. Navigate to the realesrgan git repository:\n\n   ```sh\n   cd division-algorithms\n   ```\n\n4. Use Python3 3.11.0 version in the cloned repository folder:\n\n   ```sh\n   pyenv local 3.11.0\n   ```\n\n5. Create virtual environment in the cloned repository folder:\n\n   ```sh\n   python -m venv .division-algorithms-venv\n   ```\n\n6. Activate the virtual environment (Windows OR Mac/Linux):\n\n   1. Windows\n\n   ```sh\n   .\\.division-algorithms-venv\\Scripts\\activate\n   ```\n\n   2. Mac/Linux\n\n   ```sh\n   source .division-algorithms-venv/bin/activate\n   ```\n\n7. Install the dependencies listed in the requirements.txt file:\n\n   ```sh\n   pip install -r requirements.txt\n   ```\n\n8. Install ipykernel:\n\n   ```sh\n   pip install ipykernel\n   ```\n\n9. Install Jupyter Notebook:\n\n   ```sh\n   pip install jupyter notebook\n   ```\n\n10. Add the kernel of the virtual environment in the Jupyter Notebook:\n\n    ```sh\n    ipython kernel install --user --name=.division-algorithms-venv\n    ```\n\n11. Run the Jupyter Notebook:\n\n    ```sh\n    jupyter notebook\n    ```\n\n12. Select the .division-algorithms-venv kernel to run the Jupyter Notebook.\n\n13. To Run The [Notebook](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/code/Ioannou_Georgios_Code.ipynb) (4 Options):\n       1. Steps above and also [here]()\n       2. Use [Google Colaboratory](https://colab.research.google.com/)\n       3. Use [Jupyter Notebboks Extension for VS Code](https://code.visualstudio.com/docs/datascience/jupyter-notebooks)\n       4. Use [Anaconda](https://www.anaconda.com/)\n          1. Download and install [Anaconda](https://www.anaconda.com/download)\n          2. Launch a jupyter notebook:\n              1. MacOS users, open up terminal and type in `jupyter notebook`\n              2. Window users, open up your Anaconda Power Shell, and type in `jupyter notebook`\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## Code\n\nThe full project code with the output can be found [here](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/code/Ioannou_Georgios_Code.ipynb).\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## Report\n\nThe report of this project with a comprehensive explanation of all the Division Algorithms is located [here](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf). The figures found inside the Report are located [here](https://github.com/GeorgiosIoannouCoder/division-algorithms/tree/main/figures) and [here](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Appendix.pdf).\n\n## Slides\n\nThe slides of this project are located [here](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/slides/Ioannou_Georgios_Slides.pdf).\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## Analysis and Conclusions\n\n- Number of atoms in the universe = 10\u003csup\u003e78\u003c/sup\u003e to 10\u003csup\u003e82\u003c/sup\u003e\n- Newton Raphson division algorithm = 2,097,153 digits (able to carry the most complex tasks)\n- Polynomial extended synthetic division algorithm = 300,002 nd degree polynomials\n- Newton Raphson division algorithm is the fastest and faster than Python’s built in functions\n- None of the division algorithms is considered as the best\n- There is a trade off in choosing what division algorithm to use and it depends on the task needed to be done\n\nFrom this [Report](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Report.pdf) and based on Table A5 and Graph A5, we concluded that the **fastest division algorithm for large-scale complex tasks is the Newton Raphson division algorithm.** However, it is also expected that the Goldschmidt division algorithm and the accurate quotient approximations division algorithm will also be fast. T**he Newton Raphson division algorithm is so fast that the Python programming language may want to override its integer division algorithm with this algorithm.** For smaller scale and simpler tasks, the long division algorithm can also be used.\n\n**For polynomial division it is better to implement the polynomial extended synthetic division algorithm rather than the polynomial long division algorithm because it is faster, simpler, and uses fewer resources.** The Python programming language may also consider in overriding its polydiv function with the polynomial extended synthetic division algorithm because it solves the issue of memory.\n\nBelow are the Figures found inside the [Appendix](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/report/Ioannou_Georgios_Appendix.pdf) and [Slides](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/slides/Ioannou_Georgios_Slides.pdf).\n\n- **WE CAN CLEARLY SEE FROM THE FIGURES BELOW THAT [THIS PROJECT'S IMPLEMENTATION OF NEWTON RAPHSON DIVISION ALGORITHM](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/main/figures/Newton_Raphson_Division_Algorithm/Newton_Raphson_Division_Algorithm_Code.png) WITH 81.322562 seconds BEATS PYTHON'S divmod FUNCTION WITH 82.013895 seconds AND PYTHON'S INTEGER DIVISION WITH 84.886254 seconds.**\n\n## UNSIGNED INTEGERS\n\n\u003cimg src=\"./figures/README/naive_division_algorithm.png\" alt=\"Naive Division Algorithm\"\u003e\n\n\u003cimg src=\"./figures/README/long_division_algorithm.png\" alt=\"Long Division Algorithm\"\u003e\n\n\u003cimg src=\"./figures/README/restoring_division_algorithm.png\" alt=\"Restoring Division Algorithm\"\u003e\n\n\u003cimg src=\"./figures/README/non_restoring_division_algorithm.png\" alt=\"Non-Restoring Division Algorithm\"\u003e\n\n\u003cimg src=\"./figures/README/newton_raphson_division_algorithm.png\" alt=\"Newton Raphson Division Algorithm\"\u003e\n\n\u003cimg src=\"./figures/README/python_divmod_function.png\" alt=\"Python's divmod Function\"\u003e\n\n\u003cimg src=\"./figures/README/python_integer_division.png\" alt=\"Python's Integer Division\"\u003e\n\n## POLYNOMIALS\n\n\u003cimg src=\"./figures/README/polynomial_long_division_algorithm.png\" alt=\"Polynomial Long Division Algorithm\"\u003e\n\n\u003cimg src=\"./figures/README/polynomial_extended_synthetic_division_algorithm.png\" alt=\"Polynomial Extended Synthetic Division Algorithm\"\u003e\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## Contributing\n\nContributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are **greatly appreciated**.\n\nIf you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag \"enhancement\".\nDon't forget to give the project a star! Thanks again!\n\n1. Fork the Project\n2. Create your Feature Branch (`git checkout -b feature/AmazingFeature`)\n3. Commit your Changes (`git commit -m 'Add some AmazingFeature'`)\n4. Push to the Branch (`git push origin feature/AmazingFeature`)\n5. Open a Pull Request\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## License\n\nDistributed under the MIT License. See [LICENSE](https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/master/LICENSE) for more information.\n\nMIT License\n\nCopyright (c) 2021 Georgios Ioannou\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n## Contact\n\nGeorgios Ioannou - [@LinkedIn](https://linkedin.com/in/georgiosioannoucoder)\n\nGeorgios Ioannou - [@georgiosioannoucoder](https://georgiosioannoucoder.github.io/) - Please contact me via the form in my portfolio.\n\nProject Link: [https://github.com/GeorgiosIoannouCoder/division-algorithms](https://github.com/GeorgiosIoannouCoder/division-algorithms)\n\n\u003cp align=\"right\"\u003e\u003ca href=\"#readme-top\"\u003eBack to top\u003c/a\u003e\u003c/p\u003e\n\n[contributors-shield]: https://img.shields.io/github/contributors/GeorgiosIoannouCoder/division-algorithms.svg?style=for-the-badge\n[contributors-url]: https://github.com/GeorgiosIoannouCoder/division-algorithms/graphs/contributors\n\n[forks-shield]: https://img.shields.io/github/forks/GeorgiosIoannouCoder/division-algorithms.svg?style=for-the-badge\n[forks-url]: https://github.com/GeorgiosIoannouCoder/division-algorithms/network/members\n\n[stars-shield]: https://img.shields.io/github/stars/GeorgiosIoannouCoder/division-algorithms.svg?style=for-the-badge\n[stars-url]: https://github.com/GeorgiosIoannouCoder/division-algorithms/stargazers\n\n[issues-shield]: https://img.shields.io/github/issues/GeorgiosIoannouCoder/division-algorithms.svg?style=for-the-badge\n[issues-url]: https://github.com/GeorgiosIoannouCoder/division-algorithms/issues\n\n[license-shield]: https://img.shields.io/github/license/GeorgiosIoannouCoder/division-algorithms.svg?style=for-the-badge\n[license-url]: https://github.com/GeorgiosIoannouCoder/division-algorithms/blob/master/LICENSE\n\n[linkedin-shield]: https://img.shields.io/badge/-LinkedIn-black.svg?style=for-the-badge\u0026logo=linkedin\u0026colorB=0077B5\n[linkedin-url]: https://linkedin.com/in/georgiosioannoucoder\n\n[github-shield]: https://img.shields.io/badge/-GitHub-black.svg?style=for-the-badge\u0026logo=github\u0026colorB=000\n[github-url]: https://github.com/GeorgiosIoannouCoder/\n\n[Python]: https://img.shields.io/badge/python-FFDE57?style=for-the-badge\u0026logo=python\u0026logoColor=4584B6\n[Python-url]: https://www.python.org/\n\n[JupyterNotebook]: https://img.shields.io/badge/jupyter%20notebook-808080?style=for-the-badge\u0026logo=jupyter\u0026logoColor=\n[JupyterNotebook-url]: https://jupyter.org/\n\n[Anaconda]: https://img.shields.io/badge/anaconda-000000?style=for-the-badge\u0026logo=anaconda\u0026logoColor=3eb049\n[Anaconda-url]: https://www.anaconda.com/\n\n[Pandas]: https://img.shields.io/badge/pandas-150458?style=for-the-badge\u0026logo=pandas\u0026logoColor=white\n[Pandas-url]: https://pandas.pydata.org/\n\n[Matplotlib]: https://img.shields.io/badge/matplotlib-3761a3?style=for-the-badge\u0026logo=matplotlib\u0026logoColor=white\n[Matplotlib-url]: https://matplotlib.org/\n\n[Git]: https://img.shields.io/badge/git-000000?style=for-the-badge\u0026logo=git\u0026logoColor=orange\n[Git-url]: https://git-scm.com/\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeorgiosioannoucoder%2Fdivision-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgeorgiosioannoucoder%2Fdivision-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeorgiosioannoucoder%2Fdivision-algorithms/lists"}