Optimization of Fibonacci Calculation Algorithm #2691
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description of Change
Using a vector to store Fibonacci numbers: Instead of using two strings
fibMinus1
andfibMinus2
to store the last two Fibonacci numbers, we used a vector. This made it possible to simplify the code and make it more readable.Optimization of the addition function: Instead of adding zeros to a shorter string, we just took this into account in the addition cycle, checking if the index is out of line.
Using
std::string::push_back
andstd::string::insert
: Instead of concatenating strings, we usedpush_back
andinsert
to add characters and strings. It's more efficient in terms of performance.Using
std::to_string
to convert numbers to strings: Instead of complex conversion of numbers to strings using ASCII codes, we usedstd::to_string
.Checklist
Notes: Optimized the Fibonacci calculation algorithm for better performance and readability.