Current Learning
C++ 🗁
PHP Laravel
Android Studio
Courses I have Learned
Data Structures & Algorithms 🗁
Programming Language Ⅱ - Java 🗁
Discrete Mathematics
Programming Language Ⅰ - C
Class Performance 03
Dynamic Memory Allocation, Array Task 1: Read 10 integers from the user and store them in an array[1D array]. Then find the largest element in the array. #include<iostream> using namespace std; int main(){ int array[10]; for (int i = 0; i < 10; i++) { cout << "Enter number " << i+1 << ": "; cin >> array[i]; } for (int i = 0; i < 10; i++) { if (array[0] < array[i]) { array[0] = array[i]; } } cout << "\n\nThe largest element = " << array[0]; return 0; } Task 2: Read an integer n from the user. Then, read n integers from the user and store them in an array. You can assume that n will not exceed 50. Then, reverse the order of the elements in the array and print them. #include<iostream> using namespace std; int main(){ int n, arr[50]; cout << "Input the number of elements to store in the a
