Divide et Impera

Authored by Marilena Vilciu

Computers

11th Grade - University

suma covered

Used 5+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

12 questions

Show all answers

FILL IN THE BLANK QUESTION

30 sec • 1 pt

void suma(int v[], int s, int d){
if( s>d) return ...?...;
else
return suma(v,s, (s+d)/2-1) + v[(s+d)/2]+
suma (v, (s+d)/2 +1, d);
}

Tags

suma

FILL IN THE BLANK QUESTION

45 sec • 1 pt

void suma(int v[], int s, int d){
if( s>d) return 0;
else
return suma(v,s, ...?...) + v[(s+d)/2]+
suma (v, (s+d)/2 +1, d);
}

Tags

suma

FILL IN THE BLANK QUESTION

30 sec • 1 pt

void suma(int v[], int s, int d){
if( s>d) return 0;
else
return suma(v,s, (s+d)/2-1) ...?... v[(s+d)/2]...?...
suma (v, (s+d)/2 +1, d);
}

Tags

suma

FILL IN THE BLANK QUESTION

30 sec • 1 pt

int nr(int v[], int x, int s, int d){
if(...?...) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return
1 + nr(v,x,s, m-1) +nr(v, x, m+1,d);
else
nr(v,x,s, m-1) +nr(v, x, m+1,d);
}
}

Tags

numarare

FILL IN THE BLANK QUESTION

30 sec • 1 pt

int nr(int v[], int x, int s, int d){
if(s>d) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return ...?... + nr( v, x, s, m-1) +nr (v, x, m+1,d);
else
return nr (v, x, s, m-1) +nr (v, x, m+1,d);
}
}

Tags

numarare

FILL IN THE BLANK QUESTION

30 sec • 1 pt

int nr(int v[], int x, int s, int d){
if(s>d) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return 1 + nr(v,x,s,...?...) +nrAp(v, x, m+1,d);
else
return nr(v,x,s,...?...) +nrAp(v, x, m+1,d);
}
}

Tags

numarare

FILL IN THE BLANK QUESTION

1 min • 1 pt

int maxim(int v[], int s, int d){
if (s==d) return ...?...;
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,s,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(m1>m2)return m1;
else return m2;
}
}

Tags

maxim

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

13 questions

GIT COURSE

Quiz

•

University

10 questions

Informática 1bgu Prueba#2

Quiz

•

11th Grade

12 questions

Tecnología de la Telecomunicación

Quiz

•

11th Grade

15 questions

REVIEW WEB SERVER ASJ XI TKJ

Quiz

•

11th Grade

10 questions

SHORTCUT PADA KEYBOARD

Quiz

•

10th - 12th Grade

15 questions

1.1.1 The structure and function of the processor

Quiz

•

11th Grade - University

9 questions

OCR GCSE CS - 2.1 ERL sorts and searches

Quiz

•

10th - 11th Grade

10 questions

INTRODUCCION A LA PROGRAMACION

Quiz

•

6th Grade - University

Popular Resources on Wayground

7 questions

History of Valentine's Day

Interactive video

•

4th Grade

15 questions

Fractions on a Number Line

Quiz

•

3rd Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

$fractions$

22 questions

fractions

Quiz

•

3rd Grade

15 questions

Valentine's Day Trivia

Quiz

•

3rd Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

Discover more resources for Computers

18 questions

Valentines Day Trivia

Quiz

•

3rd Grade - University

20 questions

-AR -ER -IR present tense

Quiz

•

10th - 12th Grade

21 questions

Presidents Day Trivia

Quiz

•

6th - 12th Grade

10 questions

Valentine's Day: History and Modern Celebration

Interactive video

•

9th - 12th Grade

11 questions

Valentine's Day Trivia

Quiz

•

8th - 12th Grade

10 questions

Factor Quadratic Expressions with Various Coefficients

Quiz

•

9th - 12th Grade

10 questions

Evaluating Piecewise Functions Practice

Quiz

•

11th Grade

18 questions

Success Strategies

Quiz

•

9th - 12th Grade

Divide et Impera

void suma(int v[], int s, int d){
if( s>d) return ...?...;
else
return suma(v,s, (s+d)/2-1) + v[(s+d)/2]+
suma (v, (s+d)/2 +1, d);
}

void suma(int v[], int s, int d){
if( s>d) return 0;
else
return suma(v,s, ...?...) + v[(s+d)/2]+
suma (v, (s+d)/2 +1, d);
}

void suma(int v[], int s, int d){
if( s>d) return 0;
else
return suma(v,s, (s+d)/2-1) ...?... v[(s+d)/2]...?...
suma (v, (s+d)/2 +1, d);
}

int nr(int v[], int x, int s, int d){
if(...?...) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return
1 + nr(v,x,s, m-1) +nr(v, x, m+1,d);
else
nr(v,x,s, m-1) +nr(v, x, m+1,d);
}
}

int nr(int v[], int x, int s, int d){
if(s>d) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return ...?... + nr( v, x, s, m-1) +nr (v, x, m+1,d);
else
return nr (v, x, s, m-1) +nr (v, x, m+1,d);
}
}

int nr(int v[], int x, int s, int d){
if(s>d) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return 1 + nr(v,x,s,...?...) +nrAp(v, x, m+1,d);
else
return nr(v,x,s,...?...) +nrAp(v, x, m+1,d);
}
}

int maxim(int v[], int s, int d){
if (s==d) return ...?...;
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,s,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(m1>m2)return m1;
else return m2;
}
}

int maxim(int v[], int s, int d){
if (s==d) return v[s];
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,s,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(...?...)return m1;
else return m2;
}
}

int maxim(int v[], int s, int d){
if (s==d) return v[s];
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,...?...,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(m1>m2)return m1;
else return m2;
}
}

void invers(int v[], int s, int d){
if(s<=d){
int m; m=(s+d)/2;
invers(v,m+1,...?...);
cout<<v[m];
invers(v, s, m-1);
}
}

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

Divide et Impera

void suma(int v[], int s, int d){if( s>d) return ...?...;elsereturn suma(v,s, (s+d)/2-1) + v[(s+d)/2]+suma (v, (s+d)/2 +1, d);}

void suma(int v[], int s, int d){if( s>d) return 0;elsereturn suma(v,s, ...?...) + v[(s+d)/2]+suma (v, (s+d)/2 +1, d);}

void suma(int v[], int s, int d){if( s>d) return 0;elsereturn suma(v,s, (s+d)/2-1) ...?... v[(s+d)/2]...?...suma (v, (s+d)/2 +1, d);}

int nr(int v[], int x, int s, int d){if(...?...) return 0;else {int m; m=(s+d)/2;if ( v[m]==x )return1 + nr(v,x,s, m-1) +nr(v, x, m+1,d);elsenr(v,x,s, m-1) +nr(v, x, m+1,d);}}

int nr(int v[], int x, int s, int d){if(s>d) return 0;else {int m; m=(s+d)/2;if ( v[m]==x )return ...?... + nr( v, x, s, m-1) +nr (v, x, m+1,d);elsereturn nr (v, x, s, m-1) +nr (v, x, m+1,d);}}

int nr(int v[], int x, int s, int d){if(s>d) return 0;else {int m; m=(s+d)/2;if ( v[m]==x )return 1 + nr(v,x,s,...?...) +nrAp(v, x, m+1,d);elsereturn nr(v,x,s,...?...) +nrAp(v, x, m+1,d);}}

int maxim(int v[], int s, int d){if (s==d) return ...?...;else if(s+1==d) if(v[s]>v[d]) return v[s];else return v[d];else {int m1, m2;m1=maxim(v,s,(s+d)/2);m2=maxim(v,(s+d)/2+1,d);if(m1>m2)return m1;else return m2;}}

int maxim(int v[], int s, int d){if (s==d) return v[s];else if(s+1==d) if(v[s]>v[d]) return v[s];else return v[d];else {int m1, m2;m1=maxim(v,s,(s+d)/2);m2=maxim(v,(s+d)/2+1,d);if(...?...)return m1;else return m2;}}

int maxim(int v[], int s, int d){if (s==d) return v[s];else if(s+1==d) if(v[s]>v[d]) return v[s];else return v[d];else {int m1, m2;m1=maxim(v,...?...,(s+d)/2);m2=maxim(v,(s+d)/2+1,d);if(m1>m2)return m1;else return m2;}}

void invers(int v[], int s, int d){if(s<=d){int m; m=(s+d)/2;invers(v,m+1,...?...);cout<<v[m];invers(v, s, m-1);}}

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

void suma(int v[], int s, int d){
if( s>d) return ...?...;
else
return suma(v,s, (s+d)/2-1) + v[(s+d)/2]+
suma (v, (s+d)/2 +1, d);
}

void suma(int v[], int s, int d){
if( s>d) return 0;
else
return suma(v,s, ...?...) + v[(s+d)/2]+
suma (v, (s+d)/2 +1, d);
}

void suma(int v[], int s, int d){
if( s>d) return 0;
else
return suma(v,s, (s+d)/2-1) ...?... v[(s+d)/2]...?...
suma (v, (s+d)/2 +1, d);
}

int nr(int v[], int x, int s, int d){
if(...?...) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return
1 + nr(v,x,s, m-1) +nr(v, x, m+1,d);
else
nr(v,x,s, m-1) +nr(v, x, m+1,d);
}
}

int nr(int v[], int x, int s, int d){
if(s>d) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return ...?... + nr( v, x, s, m-1) +nr (v, x, m+1,d);
else
return nr (v, x, s, m-1) +nr (v, x, m+1,d);
}
}

int nr(int v[], int x, int s, int d){
if(s>d) return 0;
else {
int m; m=(s+d)/2;
if ( v[m]==x )
return 1 + nr(v,x,s,...?...) +nrAp(v, x, m+1,d);
else
return nr(v,x,s,...?...) +nrAp(v, x, m+1,d);
}
}

int maxim(int v[], int s, int d){
if (s==d) return ...?...;
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,s,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(m1>m2)return m1;
else return m2;
}
}

int maxim(int v[], int s, int d){
if (s==d) return v[s];
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,s,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(...?...)return m1;
else return m2;
}
}

int maxim(int v[], int s, int d){
if (s==d) return v[s];
else if(s+1==d) if(v[s]>v[d]) return v[s];
else return v[d];
else {
int m1, m2;
m1=maxim(v,...?...,(s+d)/2);
m2=maxim(v,(s+d)/2+1,d);
if(m1>m2)return m1;
else return m2;
}
}

void invers(int v[], int s, int d){
if(s<=d){
int m; m=(s+d)/2;
invers(v,m+1,...?...);
cout<<v[m];
invers(v, s, m-1);
}
}