Hi, I implement the bst tree. insert, and search works now. But I am not sure why size method does not work: The error: AttributeError: 'NoneType' object has no attribute 'size' @goswami-rahul @christianbender Could you help me?

I want to add some additional matrix algorithms and some tests for that.

So, do you have a testing plan of test format, rules of in/output example data, test script name and others?

Greetings, Im a graphics designer here on Github and I would like to ask for your permission to design for your logo/icon that you maybe used for your future plans in your project. I want to help open source projects by designing logos or banners for there project. Thank you for your time reading this

Best regards -jbeguna04

• Two functions nearest_neighbor(x, tSet) and a (eulidean) distance function distance(x,y).
• I used the numpy library for calculating the absolute value of a vector.
• Two trainings sets for the logical AND-function and for color-analysing (dark/light color).

Have someone a tip for finding the k-nearest neighbors? I wrote a simple algorithm.

• [X] If creating a new file :

  • [X] added links to it in the README files ?
  • [X] included tests with it ?
  • [ ] added description (overview of algorithm, time and space compleixty, and possible edge case) in docstrings ?

• [ ] if done some changes :

  • [ ] wrote short description in the PR explaining what the changes do ?
  • [ ] Fixes #[issue number] if related to any issue

• [] other

Since we now have tests in most of the algorithms, I think it is a good idea to have a separate test_module.py file in each module. We can move all the tests from one module to it, and any further algorithms must have their tests in this file. It will make the repo easy to manage. @keon what do you think? I can start working on this.

This PR does some tasks:

• [x] : Add requirements dependency in requirements.txt for algorithms.

• [x] : Update cache, and coverall ( algorithms and tests) in Travis

• [x] : Switch to use tox for running the unittest, coveralls. Add more python environment for testing. It does not only test for python 3.6. It could probably test python 3.4, 3.5, 3.6

I added doc sting to wiggle_sort.py, modified counting_sort.py and merge_sort.py so that the type of returned array is also numpy.ndarray when the type of input array is numpy.ndarray (the other sort method already achieved this). I alos wrap function in quick_sort.py, so we can use quick sort just like other sort method. And I also modified all the files according to pep8 specification.

tests
If I ran the tests I get this kind of error message:

from search.binary_search import binary_search, binary_search_recur ImportError: No module named 'search'

or

from array.delete_nth import delete_nth, delete_nth_naive ImportError: No module named 'array.delete_nth'; 'array' is not a package

I have implemented an algorithm to solve a dp problem named "K-factor" Problem statement: The K factor of a string is defined as the number of times ‘abba’ appears as a substring. Given two numbers N and k,​ find the number of strings of length N with ‘K factor’ = k.

I have added fractional knapsack code under greedy. Given the weights and values of n items, we need to put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In Fractional Knapsack, we can break items for maximizing the total value of the knapsack.

Hey guys, I was wondering we should put all the algorithms in an algorithm folder or something. I feel like It's getting big with all those new files being added to it. I have to scroll all the way down or up to get to where I want and right now I feel it is a bit disorganized. It would be very easy for readers to just click the algorithm folder and look for the intended algorithms inside it. The extra junk can remain outside. What do you guys think?

Reference issues/PRs:

None

What does this implementation/fix? Explain your changes.

These are just some algorithm that I found useful.

algorithms/dp/ 1. Wildcard matching 2. Trapping rain water

algorithms/graph/ 1. Kadane's algorithm 2. Kahn's algorithm

Any other comments?

No