Skip to content

Test #7

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

Open
WildSeaTurtle wants to merge 10 commits into
base: master
Choose a base branch
from
Open

Test #7

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
82208d7
Add fast and recursive Fibonacci methods
ViktoriaMiroshnichenko Feb 21, 2024
239fa23
Remove unused methods in Slow.java
ViktoriaMiroshnichenko Feb 21, 2024
e3da0b3
Fix formatting in Slow.java
ViktoriaMiroshnichenko Feb 21, 2024
8721bc7
Update README.md
WildSeaTurtle Feb 21, 2024
ae7ebfc
Update TextFile.html
WildSeaTurtle Feb 21, 2024
1f3f921
Update section id and add header in TextFile.html
ViktoriaMiroshnichenko Feb 21, 2024
d84703a
Update TextFile.html
WildSeaTurtle Feb 21, 2024
9b4f3b8
Remove sections 2 and 3 and add section 4 in TextFile.html
ViktoriaMiroshnichenko Feb 21, 2024
2ed9eb9
Update title and modify navigation links in TextFile.html
ViktoriaMiroshnichenko Feb 22, 2024
eaa6e95
Increase Fibonacci calculation range and clean code
ViktoriaMiroshnichenko Feb 22, 2024
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
3 changes: 0 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,3 @@
<img width="511" alt="image" src="https://github.com/ViktoriaMiroshnichenko/slow/assets/133248817/3ad5280e-b4ac-4b9b-8152-a2721cf304cf">The Slow class demonstrates the calculation of Fibonacci numbers using both recursive
and fast iterative methods. It prints the calculated Fibonacci numbers and the time
taken for each calculation.

The main method calculates and prints Fibonacci numbers using both recursive and fast iterative methods for a range of values.
Copy link
Copy Markdown
Author

@WildSeaTurtle WildSeaTurtle Dec 4, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Also, adding a short comment about why this specific value is used would help others understand the reasoning behind it. might change later.
Consider extracting it into a named constant or configuration file for better readability and maintainability.


Expand Down
7 changes: 4 additions & 3 deletions TextFile.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>My First Webpage</title>
<title>My First Webpage23</title>
<style>
body {
font-family: Arial, sans-serif;
Expand All @@ -26,14 +26,15 @@ <h1>Welcome to My Webpage</h1>
<nav>
<ul>
<li><a href="#section1">Section 1</a></li>
<li><a href="#section2">Section 2</a></li>
<li><a href="#section3">Section 3</a></li>
</ul>
</nav>

<main>
<section id="section1">
<section id="section176857">
<h2>Section 1</h2>
<h2>Section 2</h2>
<h3>Section 1</h3>
<p>This is the content of Section 1.</p>
</section>

Expand Down
8 changes: 3 additions & 5 deletions src/my/profiler/Slow.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,21 +2,19 @@

public class Slow {
public static void main(String[] args) {
for (int i = 1; i < 50; i++) {
for (int i = 1; i < 51; i++) {
long start = System.currentTimeMillis();
System.out.println("Fibonacci recursive " + i + " = " + fibRecursive(i) + " took " + (System.currentTimeMillis() - start) + "ms");
start = System.currentTimeMillis();
System.out.println("Fibonacci fast " + i + " = " + fibFast(i) + " took " + (System.currentTimeMillis() - start) + "ms");
}


}

static long fibRecursive(long i) {
if (i < 2) return 1;
return fibRecursive(i-2) + fibRecursive(i -1);
}


static long fibFast(long i) {
if (i < 2) return i;
int a = 0, b = 1, c = 0;
Expand All @@ -27,4 +25,4 @@ static long fibFast(long i) {
}
return c;
}
}
}