Skip to content

modified sub-array #21

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
SanuraagM wants to merge 2 commits into
base: main
Choose a base branch
from
Open

modified sub-array #21

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6e4342c
modified sub-array
SanuraagM Oct 10, 2022
27bc5da
Update auction.cpp
SanuraagM Oct 20, 2022
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
4 changes: 2 additions & 2 deletions Sorting and Searching/Auction/auction.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ int main(){

int boughtIndex = getMinIndex(price); // Index with minimum price
for(int j = 0; j < n; j++){
if(price[j] > price[boughtIndex] && !bought[boughtIndex] && price[j] <= customer[i]){
if(price[j] > price[boughtIndex] && !bought[j] && price[j] <= customer[i]){
boughtIndex = j;
}
}
Expand Down Expand Up @@ -64,4 +64,4 @@ int main(){
cout << customer[i] << " ";
}

}
}
17 changes: 13 additions & 4 deletions Symphony/subarray_sum.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,12 +7,21 @@ int max_subarray_sum(int *array, int n) {
// Go through all possible subarays
// Maintain a maximum of their sum, return the maximum
int best_sum = 0;
int sum_of_this_subarray = 0;
int ender=1;
for (int i=0; i<n; i++) {
for (int j=i; j<n; j++) {
int sum_of_this_subarray = 0;
for (int k=i; k<=j; k++) {
sum_of_this_subarray += array[k];
}

if (ender==1){

for (int k=i; k<=j; k++) {

sum_of_this_subarray += array[k];
ender++;
}
}
else {sum_of_this_subarray= sum_of_this_subarray + array[j+1];}

best_sum = max(best_sum, sum_of_this_subarray);
}
}
Expand Down