Question

design an algorithm in a c++ function that takes as input a list of n integers and find the location of the last even integer in the list or returns 0 if there are no even integers in the list

Answer #1

*Thanks for the question.*

*Here is the completed code for this problem. Comments are
included, go through it, learn how things work and let me know if
you have any doubts or if you need anything to change.*

*If you are satisfied with the solution, please rate the
answer.*

*Thanks!
===========================================================================*

*#include<iostream>
using namespace std;*

*// function takes in an array of integers and the size of
the array
// function returns the lasst even number index
// if there are no even numbers in the array returns 0
int lastEvenIndex(int arr[], int size){
// iterate over the integers in the array
// from the last check if its an even then return the
index
for(int index = size-1; index>=0; index--){
// check if its even; return index
if true
if(arr[index]%2==0) return
index;
}
// if all the elements are odd then it will return
0
return 0;
}*

*int main(){
int arr[] = {1,2,3,4,5,6,7,8,9};
cout<<"Last Even Index = " <<
lastEvenIndex(arr,9) << endl;
int odds[] = {1,3,5,7,9,1,3,15,17,21};
cout<<"Last Even Index = " <<
lastEvenIndex(odds,10) << endl;
return 0;
}
================================================================*

Describe an algorithm that takes as input a list of n integers
and finds the location of the first even integer or returns -1 if
there is no even integer in the list. Here is the operation's
header:
procedure locationOfFirstEven(a1, a2, a3, ..., an
: integers)

Pseudocode an algorithm that takes
as input a list of n integers and finds the number of even integers
in the list.

1). Describe an algorithm that takes a list of n integers
a1,a2,...,an and find the average of the largest and smallest
integers in the list.

Design a recursive divide-and-conquer algorithm A(n) that takes
an integer input n ≥ 0, and returns the total number of 1’s in n’s
binary representation. Note that the input is n, not its binary
representation. For example, A(9) should return 2 as 9’s binary
representation is 1001, while A(7) should return 3 since 7 is 111
in binary. Note that your algorithm should have a running time of
O(log n). Justify your answer. You need to do the following: (1)...

Devise an algorithm that takes a list of n > 1 integers and
finds the largest and smallest values in the list.

C Programming:
Write a function that takes in an array of integers and an
integer containing the count of elements, then have it returns the
sum of all the even values inside the array.

In Python language:
Create a function that takes as input two numbers, m and n,
m<n, and returns an m×n list-of-list-of-numbers. Each element of
the outer list will be a list of consecutive integers, beginning
with 1 and ending with n−1. If you're feeling bold, try to use list
comprehension.

a) Give a recursive algorithm for finding the max of a finite
set of integers, making use of the fact that the max of n integers
is the larger of the last integer in the list and the max of the
first n-1 integers in the list.
Procedure power(x,n):
If (n=0):
return 1
Else:
return power(x,n-1) · x
b) Use induction to prove your algorithm is correct

Implement function reverse that takes a 2D list
(a list of list of integers) and returns a new 2D list where the
items in each row are in reverse order. You maynot use slicing. You
may not modify the input list. The returned list should be
completely new in memory – no aliases with the input 2D list. From
list methods, you may use only the .append().
Examples:
reverse([[1,2,3],[4,5,6]])
-> [[3,2,1],[6,5,4]]
reverse([[1,2],[3,4],[5,6]]) ->
[[2,1],[4,3][6,5]]
True
False
In python please

Write a Python function that takes a list of integers as a
parameter and returns the sum of the elements in the list. Thank
you.

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 16 minutes ago

asked 18 minutes ago

asked 19 minutes ago

asked 23 minutes ago

asked 30 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago