forked from SazinSamin/Samin_Reading_Room
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Showing
216 changed files
with
362 additions
and
362 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
#### As solving Factorial is a non-overloaping problem, so dynamic programming won't help us here, but we can dynamic approch for series of factorial (1! + 2! + 3! + 4!) | ||
#### For regular approch go to -> [Sazin's github](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/miscellaneous/Factorial) | ||
#### As solving Factorial is a non-overloaping problem, so dynamic programming won't help us here, but we can dynamic approach for series of factorial (1! + 2! + 3! + 4!) | ||
#### For regular approach go to -> [Sazin's github](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/miscellaneous/Factorial) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
### Fibonacci regular loop & recursive approch -> [Solution](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/miscellaneous/Fibonacci). | ||
### Fibonacci regular loop & recursive approach -> [Solution](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/miscellaneous/Fibonacci). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
# Gretest common divisor | ||
### [Read Wikipedia for better explaination](https://en.wikipedia.org/wiki/Greatest_common_divisor) | ||
### [Read Wikipedia for better explanation](https://en.wikipedia.org/wiki/Greatest_common_divisor) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,27 +1,27 @@ | ||
https://www.youtube.com/watch?v=uvOe510RmWc&t=717s | ||
---- This video explaination is good. Please see full video. | ||
---- This video explanation is good. Please see full video. | ||
|
||
#### Couting sort | ||
#### Counting sort | ||
|
||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Couting%20sort/1.png" width="60%"> | ||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Counting%20sort/1.png" width="60%"> | ||
|
||
1. First we have make two arrays, one for counting each elements in the array, another for storing the | ||
output. | ||
|
||
|
||
2. Count each element from the given array and store in the count array. | ||
3. | ||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Couting%20sort/2.png" width="60%"> | ||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Counting%20sort/2.png" width="60%"> | ||
3. Next add first element with next element & put in the next element array index. This will give us the | ||
position of that value from where to where. | ||
Like look at this below array, here in index 1 we have a value 2, that means the index 1 actullay represent element 1, and this element 1 will be store in first 2 position (0 and 1), | ||
Like look at this below array, here in index 1 we have a value 2, that means the index 1 actually represent element 1, and this element 1 will be store in first 2 position (0 and 1), | ||
the next index is 2, which have value 3, this has difference (3 - 2 = 1) which means it have only 1 value, which location is next (so after 0 and 1) it will be 2. | ||
|
||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Couting%20sort/3.png" width="60%"> | ||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Counting%20sort/3.png" width="60%"> | ||
4. | ||
|
||
|
||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Couting%20sort/4.png" width="60%"> | ||
<img src="https://github.com/SazinSamin/prgramming_problem_solving/blob/main/Algorithm/Sorting/Counting%20sort/4.png" width="60%"> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,2 @@ | ||
# Factorial | ||
### Dynamic programming approch -> [Sazin's Git](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/Dynamic%20Programming/Factorial) | ||
### Dynamic programming approach -> [Sazin's Git](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/Dynamic%20Programming/Factorial) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,4 @@ | ||
# Fibonacci | ||
|
||
Here we have regular solving approch. For optimization | ||
### Got to [Dynamic Programming Approch](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/Dynamic%20Programming/Fibonacci) | ||
Here we have regular solving approach. For optimization | ||
### Got to [Dynamic Programming Approach](https://github.com/SazinSamin/Samin_Reading_Room/tree/main/Algorithm/Dynamic%20Programming/Fibonacci) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,4 @@ | ||
/* | ||
If you divide a number by 0 then, | ||
C complier will generate "floating point exception". | ||
C compiler will generate "floating point exception". | ||
Dart compiler gives us "infinity" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.