codezilla
codezilla copied to clipboard
Asiatik
⚡️ codezilla ⚡️ One giant 🦖 collection of algorithms & design patterns.
## Description * Added a file named Newton-Raphson.py that implements Newton-Raphson method to find square roots. ## Related Issue https://github.com/Asiatik/codezilla/issues/455 ## Types of changes - [ ] Bug fix (change...
## Newton-Raphson Method (Python) ## This algorithm finds the real roots of a polynomial using successive approximation. Are you working on this? - **Yes**
## Description Merge Sort in Python For Example: * Added a file(s) named 'Mergesort.py' that implements 'Merge Sort'. * Changed the algorithm for performance/readablity/bugs. * Added documentation to the algorithm...
## Description * Added a file named 'EditDistance.cpp' that implements this problem using dynamic programming in C++. ## Related Issue #453 ## Types of changes - [x] New Algorithm (non-breaking...
## Title: Edit Distance (C++) ## Body: In addition to the existing Edit Distance algorithm in Java, I would like to add the C++ version. Are you working on this?...
IMPORTANT: Please do not create a Pull Request without creating an issue first. Any change needs to be discussed before proceeding. ## Description Please describe what changes you have made....
I would like to revise some mistakes in the readme.md file of [Heap Sort](https://github.com/Asiatik/codezilla/blob/master/Sorting/Heap%20Sort/Readme.md).
I would like to fix a grammar mistake in the QuickSort ReadMe file (https://github.com/Asiatik/codezilla/blob/master/Sorting/Quick Sort/Readme.md). Thank you.
Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.
IMPORTANT: Please do not create a Pull Request without creating an issue first. Any change needs to be discussed before proceeding. ## Description Please describe what changes you have made....
