Chetan Kaushik
|
d63dbb12e1
|
Merge pull request #122 from theycallmemac/master
added interpolationSearch.java
|
2017-10-03 14:49:10 +05:30 |
|
Chetan Kaushik
|
d1475f1c5b
|
Merge pull request #127 from dpacmen/patch-2
add precision_root_algorithm
|
2017-10-03 14:48:57 +05:30 |
|
Chetan Kaushik
|
4d6e69dec6
|
Merge pull request #126 from dpacmen/patch-1
add FibToN
|
2017-10-03 14:48:35 +05:30 |
|
Chetan Kaushik
|
dfe5943f57
|
Merge pull request #130 from Pusty/master
Added crc32 implementation
|
2017-10-03 14:48:13 +05:30 |
|
Chetan Kaushik
|
512cc9cf98
|
Merge pull request #131 from dpacmen/patch-3
add 0-1 knapsack
|
2017-10-03 14:47:58 +05:30 |
|
Chetan Kaushik
|
ae7edb4c08
|
Merge pull request #135 from OskarEn/master
Create GCD.java
|
2017-10-03 14:47:19 +05:30 |
|
Oskar Enmalm
|
edde956625
|
Create GCD.java
|
2017-10-03 10:02:42 +02:00 |
|
Deepak
|
9b4ae39291
|
updated
added comments and changed variable names for better understanding
|
2017-10-03 13:25:06 +05:30 |
|
Deepak
|
32d03516fe
|
update
added comments and variable names are more simpler now
|
2017-10-03 13:12:50 +05:30 |
|
Chetan Kaushik
|
0b82799927
|
Merge pull request #133 from Balance-Breaker/master
Removed unrequired Package
|
2017-10-03 12:45:18 +05:30 |
|
Balance-Breaker
|
79e2eb2826
|
Removed unrequired Package
|
2017-10-03 12:38:23 +05:30 |
|
Deepak
|
b67efdf79e
|
rodcuting dp approach
A Dynamic Programming solution for Rod cutting problem
|
2017-10-03 10:16:32 +05:30 |
|
Deepak
|
455876723b
|
add 0-1 knapsack
Very frequently asked DP problem
|
2017-10-03 09:38:34 +05:30 |
|
Deepak
|
0afa2da3ce
|
rename
.java extension added
|
2017-10-03 08:32:14 +05:30 |
|
Deepak
|
b7a9d0de44
|
rename
|
2017-10-03 08:28:04 +05:30 |
|
Pusty
|
db7300f191
|
fixed a small mistake
|
2017-10-03 04:27:09 +02:00 |
|
Pusty
|
f2bfa6a1be
|
crc32 implementation
|
2017-10-03 03:57:28 +02:00 |
|
Chetan Kaushik
|
7df4e980c4
|
Merge pull request #124 from lvncnt/master
add KMP algorithm; improve binary search
|
2017-10-03 00:05:27 +05:30 |
|
Chetan Kaushik
|
867ca11ccc
|
Merge pull request #113 from mpokryva/node-find-fix
BinaryTree find(int key) fix
|
2017-10-03 00:00:53 +05:30 |
|
Chetan Kaushik
|
f271e86636
|
Merge pull request #111 from ffahri/master
Creating ciphers and adding Caesar Cipher
|
2017-10-03 00:00:21 +05:30 |
|
Chetan Kaushik
|
ae1982e3ac
|
Merge pull request #106 from OskarEn/master
Create Abecedarian.java
|
2017-10-02 23:58:42 +05:30 |
|
Chetan Kaushik
|
01f036148f
|
Merge pull request #102 from varunu28/master
Added SieveOfEratosthenes.java
|
2017-10-02 23:58:17 +05:30 |
|
Deepak
|
355d4c1fee
|
added precision_root_algo
|
2017-10-02 13:00:39 +05:30 |
|
Deepak
|
12b86774ad
|
add FibToN
print all fibonacci till N in O(n)
|
2017-10-02 12:53:43 +05:30 |
|
feng liu
|
79a73aebb4
|
KMP algorithm
|
2017-10-01 17:45:16 -06:00 |
|
feng liu
|
85771ea74f
|
prevent (ub+lb) overflow
|
2017-10-01 17:26:05 -06:00 |
|
Manmeet Singh
|
e7f35ab8df
|
Postfix Notation using Stack
Note- Give input in the form like "1 21 + 45 13 + *"
#96
|
2017-10-02 00:42:20 +05:30 |
|
Nimit Arora
|
84b2b8ad94
|
Added Algorithm to Return Subsequences
|
2017-10-01 23:31:01 +05:30 |
|
Dheeraj Kumar Barnwal
|
f6c64409c0
|
Corrected method call
|
2017-10-01 22:55:25 +05:30 |
|
Anup Kumar Panwar
|
8b29c6ca1d
|
Merge pull request #115 from RollandMichael7/patch-2
Update LowestBasePalindrome.java
|
2017-10-01 14:09:28 +05:30 |
|
Anup Kumar Panwar
|
8f086c0b69
|
Merge pull request #116 from manmeet-22/patch-1
Tower of Hanoi using Recursion
|
2017-10-01 14:09:09 +05:30 |
|
Anup Kumar Panwar
|
77ca9326a3
|
Merge pull request #118 from nimit17/ReverseStack
Added algorithm to reverse a stack
|
2017-10-01 14:08:53 +05:30 |
|
Nimit Arora
|
727769c06f
|
Added algorithm to reverse a stack using recursion
|
2017-10-01 12:45:13 +05:30 |
|
Nimit Arora
|
dad4c69c98
|
Added algorithm to reverse a stack using recursion
|
2017-10-01 12:39:38 +05:30 |
|
Manmeet Singh
|
1e99c48d4a
|
Tower of Hanoi using Recursion
|
2017-10-01 00:17:23 +05:30 |
|
Michael Rolland
|
2d300b340a
|
Update LowestBasePalindrome.java
Very, very minor documentation edit
|
2017-09-29 14:32:47 -04:00 |
|
Michael Rolland
|
22c48e0925
|
Create AnyBaseToAnyBase
Class for converting a number between any two bases, by going through decimal.
|
2017-09-29 14:31:26 -04:00 |
|
mpokryva
|
edc51cb1e9
|
Merge branch 'master' of https://github.com/TheAlgorithms/Java into node-find-fix
|
2017-09-29 11:27:27 -04:00 |
|
mpokryva
|
e5381585a5
|
Changed find(int key) method to return null when node is not found, and updated docs accordingly. Issue #104.
|
2017-09-29 11:21:47 -04:00 |
|
Fahri YARDIMCI
|
b64b92b378
|
Creating ciphers and adding Caesar Cipher
|
2017-09-29 12:33:32 +03:00 |
|
Ayaan Faiz
|
75c55b8ce7
|
Merge pull request #1 from TheAlgorithms/master
New Merges
|
2017-09-29 13:48:09 +05:30 |
|
Anup Kumar Panwar
|
b21444d29d
|
Merge pull request #108 from RollandMichael7/patch-1
Create LowestBasePalindrome.java
|
2017-09-29 10:43:49 +05:30 |
|
Anup Kumar Panwar
|
9fd57c7d2a
|
Merge pull request #109 from icalF/master
Add longest increasing subsequence
|
2017-09-29 10:40:30 +05:30 |
|
icalF
|
dc8114c17d
|
Add longest increasing subsequence
|
2017-09-29 10:47:05 +07:00 |
|
Michael Rolland
|
658ed90553
|
Create LowestBasePalindrome.java
Algorithm for determining the lowest base in which a given integer is a palindrome.
NOTE: Has room for error, see note at line 63.
|
2017-09-28 21:32:55 -04:00 |
|
Oskar Enmalm
|
3eddef9e72
|
Update Abecedarian.java
Removed unnecessary println and compacted it
|
2017-09-29 01:04:24 +02:00 |
|
Oskar Enmalm
|
e416be63bb
|
Create Abecedarian.java
|
2017-09-29 00:49:28 +02:00 |
|
theycallmemac
|
665c6f1fb2
|
added interpolationSearch.java
|
2017-09-28 21:29:36 +01:00 |
|
Varun Upadhyay
|
701d5d1855
|
Added SieveOfEratosthenes.java
|
2017-09-28 11:38:20 -07:00 |
|
Miki Pokryvailo
|
1e52ba37c3
|
Added level order traversal, and more nodes in main method
|
2017-09-28 14:11:35 -04:00 |
|