紧急帮助请！ ！ ！函数在排序后不显示合并的数组 [英] Urgent help pls! ! ! Function is not displaying the merged array after it is sorted

问题描述

此函数合并两个升序和降序数组，并显示第三个降序数组。



#include< iostream>

#include< stdlib.h>

#include< stdio.h>



void mergedesc（）

{int i = 0，j，k = 0，A [5]，B [5]，C [10]，M，N;

std :: cout<<输入M;

std :: cin>> M;

std :: cout<<输入N;

std :: cin>> N;

std :: cout<<以升序输入第一个数组元素;

for（i = 0; i< M; i ++）

std :: cin>> A [i];



std :: cout<<输入第二个数组元素按降序排列;

for（j = 0; j< N; j ++）

std :: cin>> B [j];



while（i< M&& j> = 0）

{if（A [i]< B [j]）

{

C [k] = A [i];

i ++;

k ++;

}

else {

C [k] = B [j];

j--;

k ++;

}

std :: cout<<Sorted Array;

for（k = N-1; k< M + N; k - ）

{std :: cout<< C [k]<<;}



}}

int main（）

{

mergedesc（）;

返回0;

}



请帮助。告诉我哪里出错了，请提供正确的代码..谢谢，编码员......



我尝试过的事情：



当循环对输入的数组进行排序时更改大于和小于的符号

解决方案

< blockquote class =quote>

Quote：

请。告诉我哪里出错了，请提供正确的代码。

不，因为我们不做你的功课！ （而且我们不知道你老师告诉你的事情。）

Quote：

编译并不意味着您的代码是正确的！将开发过程视为编写电子邮件：成功编译意味着您使用正确的语言编写电子邮件 - 例如英语而不是德语 - 而不是电子邮件中包含您要发送的邮件。



所以现在你进入第二阶段的开发（实际上它是第四或第五阶段，但你会在之后的阶段进入）：测试和调试。



首先看看它做了什么，以及它与你想要的有何不同。这很重要，因为它可以为您提供有关其原因的信息。例如，如果程序旨在让用户输入一个数字并将其翻倍并打印答案，那么如果输入/输出是这样的：

输入预期输出实际输出
 1 2 1 
 2 4 4 
 3 6 9 
 4 8 16 

然后很明显问题出在将它加倍的位 - 它不会将自身加到自身上，或者将它乘以2，它会将它自身相乘并返回输入的平方。

所以，你可以查看代码和很明显，它在某处：

  int   Double （ int   value ）
 {
  return   value  * 值; 
} 

一旦你知道可能出现的问题，就开始使用调试器找出原因。在方法的第一行放置一个断点，然后运行你的应用程序。当它到达断点时，调试器将停止，并将控制权移交给您。您现在可以逐行运行代码（称为单步执行）并根据需要查看（甚至更改）变量内容（哎呀，您甚至可以更改代码并在需要时再试一次）。 />
在执行代码之前，请考虑代码中的每一行应该做什么，并将其与使用Step over按钮依次执行每一行时实际执行的操作进行比较。它符合您的期望吗？如果是这样，请转到下一行。

如果没有，为什么不呢？它有什么不同？

希望这可以帮助你找到代码的哪个部分有问题，以及问题是什么。

这是一项技能，它是一个值得开发的，因为它可以帮助你在现实世界和发展中。和所有技能一样，它只能通过使用来改进！

 std :: cout<<  按降序输入第二个数组元素; 
  for （j =  0 ; j< N; j ++）
 std： ：CIN>> B [J]。 
 
  while （i< M&& j> =  0 ）< span class =code-comment> //   *** j的值 

在上面的for循环结束时，j的值将等于B的元素数。因此，在while循环中使用j作为索引，它将太大1.在开始之前应该将它减少一个while循环。您还应该检查M和N是否永远不会大于5.

您必须使用调试器来查找它。我猜你的排序是错误的，你需要在设置结果元素之前检查两个数组的下一个匹配。



一些提示：



- 在一个自己的函数中编写排序，它将3个数组作为输入而不是排序

- 编写一些测试数据以便于调试

- 缩进代码并使用更好的名字

- 做一些输出（准备好后你可以删除它）



排序函数的原型。

  void  mergeArraysSorted（ int  * arr1 ， int  * arr2， int  * arrResult， int  count）

This function merges two arrays of ascending and descending order and displays the third array of descending order..

#include <iostream>
#include<stdlib.h>
#include<stdio.h>

void mergedesc()
{int i=0,j,k=0,A[5],B[5],C[10],M,N;
std::cout<<"Enter M";
std::cin>>M;
std::cout<<"Enter N";
std::cin>>N;
std::cout<<"Enter the first array elements in ascending order";
for(i=0;i<M;i++)
std::cin>>A[i];

std::cout<<"Enter the second array elements in descending order";
for(j=0;j<N;j++)
std::cin>>B[j];

while(i<M&&j>=0)
{if(A[i]<B[j])
{
C[k] = A[i];
i++;
k++;
}
else {
C[k] = B[j];
j--;
k++;
}
std::cout<<"Sorted Array";
for(k=N-1;k<M+N;k--)
{std::cout<<C[k]<<" ";}

}}
int main()
{
mergedesc();
return 0;
}

Pls. tell me where i am going wrong and pls supply the correct code.. Thanks, fellow coders..

What I have tried:

To change the greater than and less than signs when the loop is sorting the inputted array

解决方案

Quote:

Pls. tell me where i am going wrong and pls supply the correct code.

No, because we don't do your homework! (And we have no idea what your teacher has told you to do).

Quote:

Compiling does not mean your code is right! Think of the development process as writing an email: compiling successfully means that you wrote the email in the right language - English, rather than German for example - not that the email contained the message you wanted to send.

So now you enter the second stage of development (in reality it's the fourth or fifth, but you'll come to the earlier stages later): Testing and Debugging.

Start by looking at what it does do, and how that differs from what you wanted. This is important, because it give you information as to why it's doing it. For example, if a program is intended to let the user enter a number and it doubles it and prints the answer, then if the input / output was like this:

Input   Expected output    Actual output
  1            2                 1
  2            4                 4
  3            6                 9
  4            8                16

Then it's fairly obvious that the problem is with the bit which doubles it - it's not adding itself to itself, or multiplying it by 2, it's multiplying it by itself and returning the square of the input.
So with that, you can look at the code and it's obvious that it's somewhere here:

int Double(int value)
   {
   return value * value;
   }

Once you have an idea what might be going wrong, start using the debugger to find out why. Put a breakpoint on the first line of the method, and run your app. When it reaches the breakpoint, the debugger will stop, and hand control over to you. You can now run your code line-by-line (called "single stepping") and look at (or even change) variable contents as necessary (heck, you can even change the code and try again if you need to).
Think about what each line in the code should do before you execute it, and compare that to what it actually did when you use the "Step over" button to execute each line in turn. Did it do what you expect? If so, move on to the next line.
If not, why not? How does it differ?
Hopefully, that should help you locate which part of that code has a problem, and what the problem is.
This is a skill, and it's one which is well worth developing as it helps you in the real world as well as in development. And like all skills, it only improves by use!

std::cout<<"Enter the second array elements in descending order";
for(j=0;j<N;j++)
std::cin>>B[j];

while(i<M&&j>=0) // *** value of j

At the end of the above for loop the value of j will be equal to the number of elements of B. So using j as an index in the while loop it will be too large by 1. You should reduce it by one before starting the while loop. You should also be checking that M and N are never greater than 5.

You have to use the debugger to find it out. I guess your sorting is wrong, you need to check both array for the next match before setting a result element.

Some tips:

- write the sorting in a own function which takes the 3 arrays as input and than sorts
- write some test data for easy debuggging
- indent the code and use better names
- make some output (you can remove it when ready)

prototype for the sort function.

void mergeArraysSorted( int *arr1, int *arr2, int *arrResult, int count)

这篇关于紧急帮助请！ ！ ！函数在排序后不显示合并的数组的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！