I need to find the first Max list of an array and find it's middle. In other words, having for example this array {2, 8, 8, 8, 8, 8, 6, 3, 8, 8, 8} I need to have as a result the index 3, which is the middle of the first max list. I did try but my C++ code is still missing something. Can you please help.
Thanks
The following code is just a sample what I'm working on is an 90 elements array.
#include <iostream>
using namespace std;
int main()
{
int array[] = {2, 8, 8, 8, 8, 8, 6, 8, 0};
int Max = 0;
int StartMax = 0, EndMax = 0;
for (int m = 0 ; m < 9 ; m++){
if(array[m] > Max){
Max = array[m];
StartMax = m;
EndMax = m;
cout << "array[m] > Max " << Max << endl;
}
else if(array[m] < Max){
cout << "array[m] < Max " << Max << endl;
}
else {
int a = array[m] - array[m-1];
cout << "a = " << a << endl;
if (a == 0){
cout << "a = " << a << endl;
EndMax = m;
}
}
}
cout << "Index of Max : " << ((StartMax+EndMax)/2) << endl;
}
The problem
Your code work for this example but it won't work when you have a second "max list" which has more than 2 elements.
Indeed with array[] = {2, 8, 8, 8, 8, 8, 6, 8, 8}; (notice the last 8)
We get the result : middle=4 instead of middle3 because you enter this branch condition when you encounter 8 again :
else {
int a = array[m] - array[m-1];
And you enter the branch if (a==0) and you set EndMax to the end of the array !
StartMax = 1 and Endmax = 8 thus middle = 4
This is not what you want !
Live Code
Solution
I would suggest to use a boolean tracker to manage that instead :
size_t give_middle_max_list(const std::vector<int>& v) {
size_t idx_start_max = 0;
size_t idx_end_max = 0;
int max_val = v[0];
bool should_continue = false;
for(size_t i = 1; i < v.size(); i ++) {
if(v[i] > max_val) {
max_val = v[i];
idx_start_max = i;
idx_end_max = i;
should_continue = true;
}
else {
if (v[i] == max_val && should_continue == true) {
idx_end_max = i; // I am still in the first max list
}
else {
should_continue = false; // I am not in the first max list anymore !
}
}
}
std::cout << idx_start_max << ";" << idx_end_max << std::endl;
return (idx_end_max + idx_start_max) / 2;
}
Live code
Related
I was able to write a function that prints out the intersection of two arrays. However, I am trying to obtain the value of the members of the intersection.
If our final intersection is {6, 12} I should return 2 as the value because I have 2 members. My return value is 1 and I don't know what I am doing wrong.
int main()
{
int data1[] = { 3, 6, 9, 12};
int data2[] = { 2, 4, 6, 8, 10, 12 };
int result[] = {};
size_t length1 = sizeof(data1)/sizeof(int);
size_t length2 = sizeof(data2)/sizeof(int);
size_t resultMax= 0;
int i =0;
int j =0;
while (i < length1 && j < length2)
{
if (data1[i] < data2[j])
{
i++;
}
else if (data2[j] < data1[i])
{
j++;
}
else if (data1[i] == data2[j])
{
result[i] = data1[i];
cout << "valor : " << result[i] << endl; // output is 6 and 12
i++;
j++;
resultMax = sizeof(result[i])/sizeof(int);
}
}
cout << "Final Size: "<< resultMax; //output is 0
return resultMax;
}
Use std::vector instead of array.
# include<iostream>
# include<vector>
using namespace std;
int main()
{
vector<int> data1 = { 3, 6, 9, 12}, data2 = { 2, 4, 6, 8, 10, 12 }, result;
int i = 0, j = 0, length1 = data1.size(), length2 = data2.size();
while (i < length1 && j < length2)
{
if (data1[i] < data2[j])
i++;
else if (data2[j] < data1[i])
j++;
else if (data1[i] == data2[j])
{
result.push_back(data1[i]);
cout << "valor : " << data1[i] << endl;
i++;
j++;
}
}
cout << "Final Size: "<< result.size();
return 0;
}
Live Code
Use the algorithm library, specifically std::set_intersection.
The following is a slightly adapted example from the above linked cppreference page:
int main()
{
std::vector<int> v1{3, 6, 9, 12};
std::vector<int> v2{2, 4, 6, 8, 10, 12 };
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
std::vector<int> v_intersection;
std::set_intersection(v1.begin(), v1.end(),
v2.begin(), v2.end(),
std::back_inserter(v_intersection));
std::cout << "Final Size: "<< v_intersection.size();
}
I am trying to create a code where given an ordered array with numbers between 1 and 10, the code returns all of the values missing.
My code is as follows:
int missingArray [] = {1, 3, 4, 5, 7, 8};
for (int i = 0; i < 11; i++) {
if (missingArray[i] == i+1) {
cout << "Continue. \n";
}
if (missingArray[i] != i+1) {
cout << "The value of " << i+1 << " is missing. \n";
}
}
I want the code to return
Continue
The value of 2 is missing
Continue
Continue
Continue
The value of 6 is missing
Continue
Continue
The value of 9 is missing
The value of 10 is missing
But instead, after I get the first "missing" element, it lists everything as missing. Anyone have any suggestions?
What is REALLY going wrong is that your initial assumption - that the value (i+1) is expected at location i - becomes invalid once a missing value is detected. If you intend to detect ALL missing values, you need to decouple the array index from the value tracking. Consider the following code:
#define NMISSWING 6
int missingArray[NMISSING] = {1, 3, 4, 5, 7, 8};
int i = 0;
for (int n=1; n<=10; n++) {
if (i >= NMISSING) break; // all array entries checked
if (missingArray[i] == n) {
cout << "Continue. \n";
i += 1; // Matched i'th, move on to next
}
else {
cout << "The value of " << n << " is missing. \n";
}
}
note that I just use 'else' instead of performing essentially the same test twice. If someone is trying to teach you to to do otherwise, feel free to tell them that my opinion as a professional programmer is that that motif strikes me as academic pedantry which should be avoided
Your code leads to undefined behavior since missingArray[i] is not valid for values of i greater than 5.
You need to change your approach a little bit.
int missingArray [] = {1, 3, 4, 5, 7, 8};
int* start = missingArray;
int* end = start + sizeof(missingArray)/sizeof(*missingArray);
for (int i = 1; i < 11; i++)
{
if ( std::find(start, end, i) == end )
{
cout << i << " is missing.\n";
}
// Optionally
else
{
cout << "Found " << i << "\n";
}
}
you check missingArray[i] == i+1
1 == 1
3 == 2
4 == 3
5 == 4
...
so after first condition 1==1 others are never equal.
int missingArray[] = { 1, 3, 4, 5, 7, 8 };
int k = 0;
for (int i = 0; i < 10; i++) {
if (missingArray[k] == i + 1) {
cout << "Continue. \n";
k++;
}
else if (missingArray[k] != i + 1) {
cout << "The value of " << i + 1 << " is missing. \n";
}
}
My approach would be to select each element of the array in turn and then iterate between one greater than that value and the next element in the array.
Then to finish off iterate between the final value and the maximim value you are seeking (11 in this case).
int missingArray [] = {1, 3, 4, 5, 7, 8};
int j = 0;
for(auto i = 0U; i < sizeof(missingArray)/sizeof(int) - 1; ++i)
for(j = missingArray[i] + 1; j < missingArray[i + 1]; ++j)
std::cout << "missing: " << j << '\n';
for(++j; j < 11; ++j)
std::cout << "missing: " << j << '\n';
Output:
missing: 2
missing: 6
missing: 9
missing: 10
As Pmar said, your initial assumption was not valid. I change the code a little bit. I hope this will help you.
#include<stdio.h>
#include <iostream>
using namespace std;
int main (){
int missingArray [] = {1, 3, 4, 5, 7, 8};
int numbers_mising = 0;
for (int i = 0; i < 10; i++) {
if (missingArray[i - numbers_mising] == i+1) {
cout << "Continue. \n";
}
if (missingArray[i - numbers_mising] != i+1) {
cout << "The value of " << i+1 << " is missing. \n" << numbers_mising << "\n";
numbers_mising++;
}
}
}
In this example, also the number two is missing. You do not need to know in advance what numbers are missing with this solution. I use a variable to keep track of the numbers missing and changing the index of the array.
you can go with this logic also this is very simplest logic for you.
Expected Output:
The value of 3 is missing.
The value of 7 is missing.
int missingArray[]={1,2,4,5,6,8};
int n=sizeof(missingArray)/sizeof(missingArray[0]);
int i=0,k=1;
while (i<n)
{
if(missingArray[i]==k)
{
i++;
k++;
}
else
{
cout<<"The value of "<<k<<" is missing. \n";
k++;
}
}
int main()
{
char array[10] = {1,2,3,4,5,6,7,7,9,10};
char i;
char i_2 = 1;
char not_ok = 1;
while(i_2 < 11){
i = 0;
while(i < 10){
if(array[i] == i_2){
not_ok = 0;
}
i++;
}
if(not_ok){
printf("Missing %d\n",i_2);
}
not_ok = 1;
i_2++;
}
return 0;
}
I want to add the index of arrayOfNumbers that matched to numToMatch to an array. Not sure how to go about this. I'm new to C++. Any help would be appreciated ty.
int numToMatch[4] = {1,2,3,4};
int arrayOfNumbers[7] = {0, 1, 2, 3, 4, 5, 6};
int IndexThatMatched[4]; // Want to add to this Array.
int main()
{
for(int i = 0; i < 4; i++)
{
for(int j = 0; j < 7; j++)
{
if(numToMatch[i] == arrayOfNumbers[j])
{
cout << "Num " << numToMatch[i] << " ";
cout << "matches " << arrayOfNumbers[j];
cout << endl;
}
}
}
}
Added only two lines.
int numToMatch[4] = {1,2,3,4};
int arrayOfNumbers[7] = {0, 1, 2, 3, 4, 5, 6};
int IndexThatMatched[4]; // Want to add to this Array.
int main()
{
for(int i = 0; i < 4; i++)
{
IndexThatMatched[i] = -1;
for(int j = 0; j < 7; j++)
{
if(numToMatch[i] == arrayOfNumbers[j])
{
cout << "Num " << numToMatch[i] << " ";
cout << "matches " << arrayOfNumbers[j];
cout << endl;
IndexThatMatched[i] = j;
}
}
}
}
If there was no match for numToMatch[k] then IndexThatMatched[k] will be -1.
In your example IndexThatMatched will be: {1, 2, 3, 4}.
That's because numToMatch's elements are positioned in indices 1-4 of arrayOfNumbers.
Moreover, after that run, for any k in the safe range:
numToMatch[k] == arrayOfNumbers[IndexThatMatched[k]]
If you really want to learn C++ ditch the C-style arrays and start practising with containers. If you combine them with the functions in <algorithm> you can write something like this:
std::vector<int> MatchNums{1,2,3,4};
std::vector<int> NumsToMatch{0, 1, 2, 3, 4, 5, 6};
std::vector<int> MatchedNums;
for ( auto Number:NumsToMatch )
{
auto Match = std::find( MatchNums.begin(), MatchNums.end(), Number );
if ( Match != MatchNums.end() )
{
MatchedNums.push_back( *Match );
}
}
for ( auto i:MatchedNums )
{ //Print out the found numbers:
std::cout << i << std::endl;
}
There's a lot more ways of doing this by combining different algorithms and I encourage you to try and think of as many ways as you can and try them all out.
So I'm trying to randomize an array of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Then ask for the user to select a position in the array, and modify it. After that, it should display the number the user entered for all of the 10 values. Finally, it will need to get the original array that was randomized and reverse it.
So far, I have this
#include <iostream>
using namespace std;
int array [10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int rarray [10];
int main() {
cout << "Random Array = ";
for (int i = 0; i < 10; i++) {
int index = rand() % 10;
int temp = array[i];
array[i] = array[index];
array[index] = temp;
}
for (int i = 1; i <= 10; i++) {
cout << array[i] << " "; //somehow, this display needs to be entered into another array
}
system("PAUSE");
}
But as stated in the comment, I'm stuck on as how to do this.
You can accomplish this by using std::shuffle, std::copy, and std::reverse from the C++ Standard Library.
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int position;
// Get the position to modify and make sure it's within our bounds.
do
{
cout << "Select a position: ";
}
while (!(cin >> position) || position < 0 || position > 9);
int array[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int rarray[10];
// Shuffle the array. We use std::begin and std::end to get the bounds of
// of the array instead of guessing it's size.
std::random_shuffle(std::begin(array), std::end(array));
// Copy it to the new array
std::copy(std::begin(array), std::end(array), rarray);
// Modify the new array and display it. Add your own code here to get the
// value it is modified with.
rarray[position] = 100;
for (auto value : rarray)
cout << value << " ";
cout << endl;
// Reverse the original array and display it
std::reverse(std::begin(array), std::end(array));
for (auto value : array)
cout << value << " ";
cout << endl;
system("PAUSE");
}
or if you are not allowed to use the C++ Standard Library you will need to handle everything manually. This is a tedious task but a great example of why the C++ Standard Library should be leveraged whenever possible. This is also more prone to errors, more difficult to maintain, and ugly to look at.
int main()
{
int position;
do
{
cout << "Select a position: ";
} while (!(cin >> position) || position < 0 || position > 9);
int array[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
for (int i = 0; i < 10; i++)
{
int index = rand() % 10;
int temp = array[i];
array[i] = array[index];
array[index] = temp;
}
// Copy the array
int rarray[10];
for (int i = 0; i < 10; i++)
{
rarray[i] = array[i];
}
// Modify the new array and display it
rarray[position] = 100;
for (int i = 0; i < 10; i++)
{
cout << rarray[i] << " ";
}
cout << endl;
// Reverse the old array and display it
for (int i = 0; i < 10 / 2; i++)
{
int tmp = array[i];
array[i] = array[9 - i];
array[9 - i] = tmp;
}
for (int i = 0; i < 10; i++)
{
cout << array[i] << " ";
}
cout << endl;
system("PAUSE");
}
Both implementations are close to your original request but you may need to expand on it a little to match your requirements exactly. They should get you moving along nicely though.
If I have an array, e.g.
10, 4, 7, 8
The value of the maximum element is
10
How can I find this value?
Here's my attempt:
int highNum = 0;
int m;
int list[4] = {10, 4, 7, 8};
for (m = 0 ; m < size ; m++);
{
if (list[m] > highNum)
highNum = list[m];
cout << list[m];
}
cout << highNum;
I am trying to write a simple loop to store a max value from an array, and I wrote this thinking it would work, but for some reason at the beginning of the for loop it stores the m variable as 4 and exits the loop.
Unless you're doing this for homework and have to write the loop, just use std::max_element, as in:
int list[4] = {10, 4, 7, 8};
std::cout << *std::max_element(list, list+4);
...or better, avoid hard-coding the length:
int list[] = {10, 4, 7, 8};
std::cout << *std::max_element(std::begin(list), std::end(list));
You have a semicolon after your for statement:
for (m = 0 ; m < size ; m++);
{
This should be:
for (m = 0 ; m < size ; m++)
{
int highNum = 0;
int m;
int list[4] = {10, 4, 7, 8};
for (m = 0 ; m < size ; m++); // <-- semicolon?
{
if (list[m] > highNum)
highNum = list[m];
cout << list[m];
}
cout << highNum;
Looking at your indentation, you may have missed a pair of { ... } for the if statement as well.
There is a ; right after the closing parentheses of your for loop:
for (m = 0 ; m < size ; m++);
The statements inside the block (inside the curly braces) gets executed only after the loop do nothing for size number of times and that too only once.
You have also missed a pair of { ... } for the if statement as well.
You put a superfluous at the end ; in :
for (m = 0 ; m < size ; m++);
Edit : Working code with some additional << endl;
int size = 4;
int highNum = 0;
int m;
int list[4] = {10, 4, 7, 8};
for (m = 0 ; m < size ; m++)
{
if (list[m] > highNum)
highNum = list[m];
cout << list[m] << endl;
}
cout << highNum << endl;