OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

updated time complexity

Browse Source 
if all the prices are same case(o(n)).
This commit is contained in:
ABHISHEK-821005 2020-10-26 12:51:34 +05:30 committed by GitHub
parent c19b4896c1
commit e272befbd7
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 14 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
dynamic_programming/cut_rod.cpp
View File

@ -61,18 +61,11 @@ int maxProfitByCuttingRod(const std::array<int, T> &price, const int n) {
delete[] profit; delete[] profit;
return ans; // returning maximum profit return ans; // returning maximum profit
} }
} // namespace cut_rod
} // namespace dynamic_programming
/**
* @brief Function to test above algorithm
* @returns void
*/
template <size_t T> template <size_t T>
bool WhatIfAllPricesAreSame(const std::array<int, T> &price, const int n){ bool WhatIfAllPricesAreSame(const std::array<int, T> &price, const uint64_t &n){
/* /*
@ -108,7 +101,18 @@ CR(0)
} }
return true; return true;
} }// checks whether all the prices are same or not
} // namespace cut_rod
} // namespace dynamic_programming
/**
* @brief Function to test above algorithm
* @returns void
*/
static void test() { static void test() {
@ -119,7 +123,7 @@ static void test() {
dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1); dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);
const int expected_max_profit1 = 22; const int expected_max_profit1 = 22;
if( WhatIfAllPricesAreSame(price1,n1)){ if(dynamic_programming::cut_rod::WhatIfAllPricesAreSame(price1,n1)){
std::cout << "Maximum profit with " << n1 << " inch road is " <<(n1)*price1[0] std::cout << "Maximum profit with " << n1 << " inch road is " <<(n1)*price1[0]
<< std::endl; << std::endl;
} }