zzos/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-09-30 17:38:07 +08:00
Code Issues Packages Projects Releases Wiki Activity
205 Commits 13 Branches 0 Tags
e74b99515bb9141ab35be2af2becd41b6037c514
Commit Graph
205 Commits
This Branch
This Branch
All Branches
Author SHA1 Message Date
Harshil e74b99515b Merge pull request #86 from frmatias/patch-2 
Update .travis.yml
 2017-06-21 08:59:47 +05:30
Francisco Matias c313a7bb4f Update .travis.yml 2017-06-20 22:08:03 -03:00
Harshil 65de84b0f1 Merge pull request #81 from gupta2140/master 
Added feature for negative number input
 2017-06-08 08:30:46 +05:30
amankumargupta 4fe88f2f8e Added feature for negative number input 2017-06-07 23:41:44 +05:30
Harshil ef9082b468 Merge pull request #80 from gupta2140/master 
Fixed infinite loop while entering, and preorder traversal.
 2017-06-07 16:33:32 +05:30
amankumargupta c5fbb3e772 Fixed infinite loop while entering, and preorder traversal. 2017-06-07 15:50:53 +05:30
Chetan Kaushik e268bf1b4d Merge pull request #75 from alaouimehdi1995/master 
Fixing some terms number issue, and improving result for first terms (0 and 1)
 2017-04-13 11:27:24 +05:30
Mehdi ALAOUI ce8b025320 Adding spaces between operators 2017-04-12 14:45:56 +01:00
Mehdi ALAOUI 9a756d1940 Fixing some terms number issue, and improving result for first terms (0 and 1) 2017-04-11 23:10:52 +01:00
Chetan Kaushik 7814b28b79 Merge pull request #74 from alaouimehdi1995/master 
Script Output: The entire longest increasing subsequence instead of it's length
 2017-04-10 20:32:47 +05:30
Mehdi ALAOUI 08cbd113a4 Code optimized and complexity decreased 2017-04-10 13:49:01 +01:00
Mehdi ALAOUI e01cf425bd Comments reviewed 2017-04-07 03:27:15 +01:00
Mehdi ALAOUI 628f184af5 The program returns now the longest increasing subsequence instead of returning only the length. Code optimized and well commented 2017-04-07 03:19:02 +01:00
Anup Kumar Panwar 408c5d0e80 Merge pull request #73 from alaouimehdi1995/master 
More concise, optimized and readable code in sorts/quick_sort.py file
 2017-04-06 17:40:29 +05:30
Mehdi ALAOUI 7ae9759220 Added some other spaces 2017-04-06 03:55:28 +01:00
Mehdi ALAOUI 8d06eb2c63 Added some space before and after operators 2017-04-06 03:44:47 +01:00
Chetan Kaushik d1ac134973 Merge pull request #72 from ankit167/Heap_Data_Structure 
Code for Heap data structure
 2017-04-05 12:22:55 +05:30
Mehdi ALAOUI 183df6889b Code more concise and more readable 2017-04-05 06:58:16 +01:00
Ankit Agarwal fa1e65ee0f Fixing print statement 2017-04-01 21:28:12 +05:30
Ankit Agarwal e15c0aacc9 Contributing code for Heap data structure, and 
all basic operations associated with it.
 2017-04-01 21:16:11 +05:30
Harshil 8fe29ffaa2 Merge pull request #70 from SylvainDe/master 
Add most recent Python versions in Travis CI
 2017-03-07 08:37:24 +05:30
Sylvain 52f71d933b Add most recent Python versions in Travis CI 
Add more recent Python versions including
development branches and nightly build.
 2017-03-06 21:06:15 +01:00
Harshil 1a434dd2d4 Merge pull request #69 from theycallmemac/patch-3 
Create radix_sort.py
 2017-02-25 20:54:40 +05:30
James Mc Dermott e823c55f62 Create radix_sort.py 2017-02-25 15:06:58 +00:00
Harshil 94a30990e9 Merge pull request #68 from prateekiiest/patch-4 
Create normal_distribution_QuickSort_README.md
 2017-02-07 14:19:49 +05:30
Prateek Chanda f42a1b8fbc Create normal_distribution_QuickSort_README.md 2017-02-05 17:52:31 +05:30
Anup Kumar Panwar 13d74ed460 Merge pull request #67 from TheAlgorithms/revert-66-master 
Revert "Update Normal Distribution QuickSort Readme"
 2017-02-04 18:15:55 +05:30
Anup Kumar Panwar ea36ef407b Revert "Update Normal Distribution QuickSort Readme" 2017-02-04 18:15:41 +05:30
Anup Kumar Panwar 04f13daf10 Merge pull request #66 from prateekiiest/master 
Update Normal Distribution QuickSort Readme
 2017-02-04 18:15:16 +05:30
Prateek Chanda a484b47cdf Update README.md 2017-02-04 15:06:49 +05:30
Prateek Chanda d4e35fb430 Create normal_distribution_QuickSort_README.md 2017-02-04 15:02:23 +05:30
Prateek Chanda c2b7ba3614 Delete normaldistribution_quicksort_README.md 2017-02-04 14:35:30 +05:30
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