//Array partitioning challenge - V2 #include #include #include #include using namespace std; //convert our string to vector array. Only spaces between digits. vector* stringToVectorInt(string str) { vector* arrayV = new vector; do { auto cutPosition = str.find(' ', 0); if (cutPosition == str.npos)cutPosition = str.length(); // delete before first element spaces if (str.front() == ' ') {str.erase(0); continue;} //delete after last element spaces if(str.back() == ' '){str.pop_back(); continue; } //delete double and more spaces bettween numbers if(cutPosition!=str.npos) if(str[cutPosition]==' ' && str[cutPosition+1] == ' ') { str.erase(cutPosition, cutPosition); continue; } //cout << cutPosition << " -- " << str.length()<<" -- " << str << endl; arrayV->push_back(stoi(str.substr(0, cutPosition))); if ((str.length() - cutPosition) > 0) str = str.substr(cutPosition + 1, str.length() - cutPosition); else break; } while (true); return arrayV; } int main() { cout << "Enter numbers over space" << endl; string str; getline(cin, str); vector* pArray; pArray = stringToVectorInt(str); //here is algorithm start. //Sorting our array ascending std::sort(pArray->begin(), pArray->end()); int sumLeft = 0, sumRight = 0, pos; string leftStr, rightStr; pos = pArray->size()-1; //cout << "pos " << pos; sumRight = pArray->at(pos); rightStr = to_string(pArray->at(pos)); pos--; // plus the hier number in array to smaller sum. while (pos >= 0) { if (sumLeft < sumRight) { sumLeft += pArray->at(pos); leftStr += ' '; leftStr += to_string(pArray->at(pos)); } else { sumRight += pArray->at(pos); rightStr += ' '; rightStr += to_string(pArray->at(pos)); } pos--; } cout << endl << "First sub array :" << leftStr; cout << endl << "Second sub array :" << rightStr; cout << endl<<"Absolute difference = "<

Array partitioning. Good algorithm.