Prateek Chanda
ea52ca8ee0
Create normaldistribution_quicksort_README.md
2017-02-04 14:12:16 +05:30
Prateek Chanda
f707513eea
Rename randomquicksort.py to random_normaldistribution_quicksort.py
2017-02-04 13:59:48 +05:30
Prateek Chanda
3040022f0b
Create randomquicksort.py
2017-02-04 12:20:55 +05:30
Anup Kumar Panwar
bbd96ecc18
Merge pull request #65 from prateekiiest/patch-3
...
Create random_normaldistribution_quicksort.py
2017-02-03 22:44:31 +05:30
Prateek Chanda
a3ab980816
random_normaldistribution_quicksort
...
This is for creating an algorithm implementing QuickSort Algorithm where the pivot element is chosen randomly between first and last elements of the array and the array elements are taken from a Standard Normal Distribution.
This is different from the ordinary quicksort in the sense, that it applies more to real life problems , where elements usually follow a normal distribution. Also the pivot is randomized to make it a more generic one.
2017-02-03 22:02:05 +05:30
Harshil
d68666ddba
Merge pull request #63 from umsh1ume/master
...
Corrected title in longest_sub_array
2017-01-10 07:34:36 +05:30
umesh
a43d0f312a
corrected title
2017-01-10 00:14:48 +05:30
umesh
655aecc338
corrected problem title
2017-01-10 00:11:50 +05:30
Harshil
6f9d65f477
Merge pull request #62 from dhruvsaini/patch-4
...
Create longest_increasing_subsequence.py
2017-01-03 16:56:52 +05:30
dhruvsaini
436edf3a88
Create longest_increasing_subsequence.py
...
The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6
2017-01-03 16:54:38 +05:30
Harshil
bdde8268c6
Merge pull request #61 from dhruvsaini/patch-3
...
Create knapsack.py
2017-01-03 16:51:39 +05:30
dhruvsaini
5a3059784f
Create knapsack.py
...
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack.
2017-01-03 16:50:13 +05:30
Chetan Kaushik
7a08d09079
Merge pull request #60 from dhruvsaini/patch-2
...
Create minimum_partition.py
2017-01-03 16:44:34 +05:30
dhruvsaini
688a9ab3bc
Create minimum_partition.py
...
Partition a set into two subsets such that the difference of subset sums is minimum
2017-01-03 16:42:31 +05:30
Harshil
ce7732605d
Merge pull request #59 from alvin562/master
...
updated version
2017-01-03 13:38:23 +05:30
alvin562
839a84182c
updated version
2017-01-03 00:08:42 -08:00
Harshil
5bed476a0a
Merge pull request #58 from dhruvsaini/patch-1
...
Create longest common subsequence.py
2017-01-02 21:01:09 +05:30
dhruvsaini
8e29c832a7
Create longest common subsequence.py
...
LCS Problem Statement: Given two sequences, find the length of longest subsequence present in both of them.
A subsequence is a sequence that appears in the same relative order, but not necessarily continious.
Example:"abc", "abg" are subsequences of "abcdefgh".
2017-01-02 20:51:37 +05:30
Chetan Kaushik
ecd22436d3
Merge pull request #55 from prateekiiest/master
...
Updated README.md for Sorting Graphs
2016-12-22 20:52:42 +05:30
Chetan Kaushik
b2b8fd490b
Merge pull request #56 from TheAlgorithms/revert-53-master
...
Revert "Upadated RSA Algorithm under Cryptography Section"
2016-12-22 20:42:38 +05:30
Chetan Kaushik
2c07216e6c
Revert "Upadated RSA Algorithm under Cryptography Section"
2016-12-22 20:39:20 +05:30
Prateek Chanda
96f5a2cf57
Update README.md
2016-12-22 08:56:50 +05:30
Prateek Chanda
71fabeaea3
Update README.md
2016-12-13 16:24:41 +05:30
Prateek Chanda
d521e5ecc6
Add files via upload
2016-12-13 16:17:57 +05:30
Anup Kumar Panwar
0115ee7842
Merge pull request #53 from prateekiiest/master
...
Upadated RSA Algorithm under Cryptography Section
2016-12-13 12:04:39 +05:30
Prateek Chanda
ab9e034a08
Rename RSA to RSA.py
2016-12-12 18:40:07 +05:30
Prateek Chanda
175395088b
RSA Algorithm
...
Uploaded solution for RSA Algorithm
2016-12-12 18:39:24 +05:30
Chetan Kaushik
02ea8d0481
Merge pull request #52 from alvin562/master
...
added nested brackets problem
2016-12-11 15:05:22 +05:30
alvin562
1d765f9104
made it compatible with python 3.x
2016-12-11 01:35:51 -08:00
alvin562
a75a64aa9b
added nested brackets problem
2016-12-11 01:23:33 -08:00
Chetan Kaushik
19d1050b98
Merge pull request #51 from tlaivamaa/master
...
Added implementations of gnome sort and cocktail shaker sort
2016-12-04 20:41:59 +05:30
Tommi Laivamaa
8f93472071
Added implementations of gnome sort and cocktail shaker sort
2016-12-04 17:00:20 +02:00
Chetan Kaushik
e26ed2b71d
Merge pull request #50 from RianGallagher/master
...
Added Doubly Linked List
2016-11-29 06:11:32 -08:00
Rian Gallagher
46900cb1e5
Added Doubly Linked List
2016-11-29 13:44:09 +00:00
Chetan Kaushik
95ee8b4d6f
Merge pull request #49 from yvonneFtMore/master
...
add sum of the longest sub array
2016-11-28 22:03:41 -08:00
Yvonne
ac5d2354ba
add sum of the longest sub array
2016-11-29 13:18:47 +08:00
Harshil
e76dc6654f
Merge pull request #48 from RianGallagher/master
...
Added Sieve of Eratosthenes algorithm for finding primes
2016-11-21 05:45:51 +05:30
Rian Gallagher
4a6894c1fa
Added Sieve of Eratosthenes for finding primes
2016-11-20 22:11:50 +00:00
Rian Gallagher
664b35252e
Added Sieve of Eratosthenes algorithm for finding primes
2016-11-20 21:44:21 +00:00
Harshil
3f505c5b39
Merge pull request #46 from Henocks/patch-2
...
Slight Performance/Visual Update
2016-11-09 19:55:27 +05:30
Henocks
43513803f0
Slight Performance/Visual Update
2016-11-09 23:17:04 +09:00
Chetan Kaushik
18afe45e4a
Merge pull request #45 from Henocks/patch-1
...
Update __init__.py
2016-10-31 12:24:37 +05:30
Henocks
f942742455
Update __init__.py
2016-10-31 15:40:33 +09:00
Chetan Kaushik
ba16772456
Create License
2016-10-30 21:28:35 +05:30
Harshil
9b054f55d5
Merge pull request #40 from theycallmemac/patch-1
...
Create __init__.py
2016-10-14 22:25:35 +05:30
Chetan Kaushik
6bff82652f
Merge pull request #41 from theycallmemac/patch-2
...
Create __init__.py
2016-10-14 22:00:30 +05:30
James Mc Dermott
4a8fa8bfeb
Create __init__.py
...
Initialising a LinkedList class, using a Node class to store the item and the next pointer.
2016-10-14 17:23:07 +01:00
James Mc Dermott
4eddeb9396
Create __init__.py
...
Initialising of a Stack Class, has three methods: is_empty, push and pop.
2016-10-14 16:15:26 +01:00
Chetan Kaushik
0dbd2df11b
Merge pull request #39 from akshaysharma096/master
...
added isinstance check
2016-10-14 08:09:21 +05:30
Akshay Sharma
d62e8e2868
travis cli build fail
2016-10-14 01:27:52 +05:30
