C++1次元配列_配列内の最大の要素、配列の逆置き、バブルソートを見つけます.
1966 ワード
#include
using namespace std;
// , ,
int main()
{
//1、
int arr[5] = { 300,350,200,400,250 };
//2、
int max = 0;// 0;
for (int i = 0; i < 5; i++)
{
// ,
if (arr[i] > max)
{
max = arr[i];
}
}
//3、
cout << " :" << max << endl;
system("pause");
return 0;
}
#include
using namespace std;
//
int main()
{
//1、
int arr[5] = { 1,4,5,8,6 };
cout << " :" << endl;
for (int i = 0; i < 5; i++)
{
cout << arr[i] << endl;
}
//2、
//2.1
//2.2
//2.3
//2.4 ++ --
//2.5 2.1 , <=
int start = 0;//
int end = sizeof(arr) / sizeof(arr[0]) - 1;//
while (start < end)
{
//
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
//
start++;
end--;
}
//3、
cout << " :" << endl;
for (int i = 0; i < 5; i++)
{
cout << arr[i] << endl;
}
system("pause");
return 0;
}
#include
using namespace std;
//
int main()
{
int arr[9] = { 4,8,2,3,6,5,1,9,7 };
cout << " : " << endl;
for (int i = 0; i < 9; i++)
{
cout << arr[i] << " ";
}
cout << endl;
//
/*
= -1;
= - -1;
*/
for (int i = 0; i < 9 - 1; i++)
{
// = - -1;
for (int j = 0; j < 9 - i-1; j++)
{
// , ,
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
cout << " : " << endl;
for (int i = 0; i < 9; i++)
{
cout << arr[i] << " ";
}
cout << endl;
system("pause");
return 0;
}