using namespace std; int main() [double degree [6] [2] =(30,40,10,70, 20, 30, 60, 70, 30, 10, 10, 85); int buffer=degree[0][0]; for (int i=1;i<6; i++) if (degree[i][0]>buffer) buffer=degree[i][0]; cout<

New Perspectives on HTML5, CSS3, and JavaScript
6th Edition
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Patrick M. Carey
Chapter14: Exploring Object-based Programming: Designing An Online Poker
Section14.1: Visual Overview: Custom Objects, Properties, And Methods
Problem 7QC
icon
Related questions
Question
#include <iostream>
using namespace std;
int main()
(double degree [6] [2] = {30,40,10,70, 20, 30, 60, 70, 30, 10, 10, 85);
int buffer=degree[0][0];
for (int i=1;i<6; i++)
if (degree[i][0]>buffer)
buffer=degree[i][0];
cout<<buffer;
return 0; }
70
{
85
...
30
docs.google.com
60
#include<iostream>
using namespace std;
int main()
{
int j=1;
while (j<=10)
if ((j%3)==0)
cout<<j<<"\n";
j++; }
return 0:
+
14
۹:۱۳
G
↑
Transcribed Image Text:#include <iostream> using namespace std; int main() (double degree [6] [2] = {30,40,10,70, 20, 30, 60, 70, 30, 10, 10, 85); int buffer=degree[0][0]; for (int i=1;i<6; i++) if (degree[i][0]>buffer) buffer=degree[i][0]; cout<<buffer; return 0; } 70 { 85 ... 30 docs.google.com 60 #include<iostream> using namespace std; int main() { int j=1; while (j<=10) if ((j%3)==0) cout<<j<<"\n"; j++; } return 0: + 14 ۹:۱۳ G ↑
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
New Perspectives on HTML5, CSS3, and JavaScript
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning