Answer:
#include <iostream>
using namespace std;
int main() {
int currentYear = 2020;
int myCurrentAge = 23;
int myNewAge=myCurrentAge+(2050-currentYear);
cout << "My Current Age is " << myCurrentAge << endl;
cout << "I will be " << myNewAge << " in 2050." << endl;
}
Explanation:
- Initialize the currentYear with 2020 and myCurrentAge with 23.
- Add myCurrentAge with the the result of (2015 - currentYear) and assign this result to myNewAge variable.
- Finally display my current age and after that display the new age in 2050.
Output:
My Current Age is 23
I will be 53 in 2050.
I have only 5 so hope it helps.
1. bluehost
2. HostGator
3. GoDaddy
4. network solutions
5. web.com
Answer:
The quicksort pivot is an arbitrary element within the collection that is being sorted. Using the pivot point, the collection of elements is partitioned into two smaller lists of elements. Using some logic, the smaller elements are placed left of the pivot point, and larger elements are placed to the right of the pivot point. Ideally, you would prefer you pivot point to be a median of your dataset to optimize the creation of the two sublists into a balanced state.
Cheers.
