Skip to content
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

renamed files in issues section #94

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

renamed files in issues section #94

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
2 changes: 1 addition & 1 deletion algorithms/dynamic-programming/EDIST.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@

// A Naive recursive Java program to find minimum number
// operations to convert str1 to str2
class EDIST {
class Edist {
static int min(int x, int y, int z) {
if (x <= y && x <= z)
return x;
Expand Down
2 changes: 1 addition & 1 deletion algorithms/dynamic-programming/fibonacci.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@

// Fibonacci Series using Dynamic Programming
class fibonacci {
class Fibonacci {
static int fib(int n) {
/* Declare an array to store Fibonacci numbers. */
int f[] = new int[n + 2]; // 1 extra to handle case, n = 0
Expand Down