Answer:
#include <iostream>
#include <vector>
using namespace std;
void swapFrontBack(vector<int>& nums) {
if(nums.size() < 2) {
return;
}
swap(nums[0], nums[nums.size()-1]);
}
void printit(vector<int>& arr) {
for(int i = 0; i < arr.size(); i++) {
cout << arr[i] << " ";
}
cout << endl;
}
int main() {
vector<int> num1;
swapFrontBack(num1);
printit(num1);
num1.push_back(1);
swapFrontBack(num1);
printit(num1);
num1.push_back(2);
swapFrontBack(num1);
printit(num1);
vector<int> num2(10, 1);
num2[9] = 2;
swapFrontBack(num2);
printit(num2);
return 0;
}
Explanation:
Answer:
Static
Explanation:
I just took the test man!
Answer:
24
Explanation:
factorial operation 4! = 4×3×2×1 = 24
If you print the binary digits just like that, they'll be in the wrong order (lsb to msb). Below program uses recursion to print the digits msb to lsb. Just for fun.
void printBits(unsigned int n)
{
if (n > 1) {
printBits(n >> 1);
}
printf((n & 1) ? "1" : "0");
}
int main()
{
unsigned int number;
printf("Enter an integer number: ");
scanf_s("%d", &number);
printBits(number);
}
