Demo of Java array and code that assigns values based on the membership of the array

Given: an int variable k , an int array currentMembers that has been declared and initialized, an int variable memberID that has been initialized, and an boolean variable isAMember , write code that assigns true to isAMember if the value of memberID can be found in currentMembers , and that assigns false to isAMember otherwise. Use only k , currentMembers , memberID , and isAMember .

Demo of Java array and code that assigns values based on the membership of the array

Given: an int variable k , an int array currentMembers that has been declared and initialized, an int variable memberID that has been initialized, and an boolean variable isAMember , write code that assigns true to isAMember if the value of memberID can be found in currentMembers , and that assigns false to isAMember otherwise. Use only k , currentMembers , memberID , and isAMember . Please explain in detail to aid learning process

Find the Largest and Smallest and Sort all the values in an Array in ascending order

Write two function in C++ with using arrays to find largest and smallest number. For example you have 1,43,42,9,8,5. You need arrange them smallest to highest and highest to smallest.

Efficiency of algorithm finding the second smallest of n elements

Prove that the second smallest of n elements can be found with n + cieling(log n) - 2 comparisons in the worst case.

Algorithm to find majority element

Let A be an array of n elements. An element x is said to be a majority element in A if it occurs in A more than n/2 times. Assume that the only comparisons allowed between elements are tests of equality. Give an algorithm that uses no more than 2n comparisons to determine whether the array A contains a majority element and, if so, find it.