Skip to content

docs: Fix a few typos #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

docs: Fix a few typos #10

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
<img src="https://cloud.githubusercontent.com/assets/5885065/5642960/fbc4d352-9606-11e4-91fb-5f5c458b52d0.png"
alt="algo Logo" title="algo" align="right" />

This is the Official Documentation of algo module. This API provides an implementation of different algorithms. The algorithms library defines functions for a variety of purposes (e.g. data structures, searching, sorting, counting, manipulating data) that operate on ranges of elements. Provided algorithms were collected after one year research that analyzed the most commonly used algoithms in Software Engineering. The module was created in order to help Python developers to easily utilize those frequently used algorithms without having to implement them. Written algorithms include topics from different subfields of Computer Science. The current version of the module contains 50 algorithms. We are planning to increase the number of algorithms in the second version of this API. It is important to note that the license of algo module is distributed under [Apache Licese] [web2].
This is the Official Documentation of algo module. This API provides an implementation of different algorithms. The algorithms library defines functions for a variety of purposes (e.g. data structures, searching, sorting, counting, manipulating data) that operate on ranges of elements. Provided algorithms were collected after one year research that analyzed the most commonly used algorithms in Software Engineering. The module was created in order to help Python developers to easily utilize those frequently used algorithms without having to implement them. Written algorithms include topics from different subfields of Computer Science. The current version of the module contains 50 algorithms. We are planning to increase the number of algorithms in the second version of this API. It is important to note that the license of algo module is distributed under [Apache Licese] [web2].

### Installation

Expand Down Expand Up @@ -78,7 +78,7 @@ A sorting algorithm is an algorithm that puts elements of a list(lst) in a certa

6. Merge_Sort(lst) - For description read: http://en.wikipedia.org/wiki/Merge_sort

7. Quick_Sort(lst) - For descritopn read: http://en.wikipedia.org/wiki/Quicksort
7. Quick_Sort(lst) - For description read: http://en.wikipedia.org/wiki/Quicksort


##### HASHING ALGORITHMS
Expand Down Expand Up @@ -136,7 +136,7 @@ In computer science, a search algorithm is an algorithm for finding an item with

4. find_max_subarray(numbers) - Finds the contiguous subarray within a one-dimensional array of numbers which has the largest sum.

5. permutations(l) - A generator that retursn all the permutations of the given list l.
5. permutations(l) - A generator that returns all the permutations of the given list l.

6. is_polindrom(string) - Checks whether the given string is a polindrom or not.

Expand Down
2 changes: 1 addition & 1 deletion algo.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -901,7 +901,7 @@ def find_max_subarray(numbers):
""" 30. LIST PERMUTATIONS

DEFINITION
This genrator returs all the permutations for the given list.
This generator returns all the permutations for the given list.
"""
def permutations(l):
""" Generator for list permutations. """
Expand Down