. , , .
2. ( ):
)
)
1 - -
3. Pascal ( , Pascal):
Program sortirovka_po_vozrostaniu;
Uses crt;
const n=7;
var a:array[1..n] of integer;
i,j,x: integer;
begin { }
clrscr;
writeln (' ':60);
writeln;
for i:=1 to n do
begin
write (' ',i,' : ');
readln (a[i]);
end;
writeln;
write (' : ');
for i:=1 to n do
write (a[i]:4);
writeln;
writeln;
write (' : ');
for i:=1 to n-1 do
for j:=i+1 to n do
if a[i]>a[j] then
begin
x:=a[i];
a[i]:=a[j];
a[j]:=x;
end;
for i:=1 to n do
write(a[i]:4);
writeln;
gotoxy(24,25);
write (' Enter...');
readln;
end.
Pascal ( ):
C++( , ++):
// Program sortirovka_po_vozrostaniu
# include <iostream>
# include <iomanip>
# include <math.h>
using namespace std;
int main () //
{
setlocale (LC_ALL, "Russian");
constint n=7; //
int a[n]; //
inti,j,x; //
cout<< " 7 \n "<<endl;
cout<<endl;
cout<<" \n" <<endl;
for (i=1;i<=n;i++)
{
cin>>a[i];
};
cout<<" \n";
for (i=1;i<=n;i++)
{
cout<<a[i]<<setw(7);
};
cout<<endl;
cout<<" \n"<<endl;
for (i=1; i<= n-1; i++)
for (j=i+1; j<= n; j++)
{
if (a[i]>a[j])
{
x=a[i];
a[i]=a[j];
a[j]=x;
};
};
for (i=1; i<=n; i++)
{
cout<<a[i]<<setw(7);
};
cout<<'\n';
system ("pause");
return 0;
}
C++ ( ):
4 :
1. . . / . . , . . . .: , 1990. 256 .
2. . . : / . . . .: , 1991. 356 .
3. . . TurboPascal 7.0
/ . . . .: , 1996. 350 .
4. . . TURBO PASCAL 6.0, 7.0
/ . . . .: ; , 1993. 384 .
5. . Excel 2010. : . . / . . : BHV, 2011. 704 .
6. : . / . . . . . .: , 1998. 448 .
|
|
|
7. . . . : / . .. .: , 2008 450 .
8. . . ++. - : / . . . .: , 2008 450 .
9. : / . . . . .: , 2002. 336 .
10. : / . .. . .: , 2002. 638 .
11. : / . . . . 3- . .: , 2001. 256 .
12. :. / . . . . 3- . .: , 2001. 765 .
13. . C++ (). / . , , . , . 4- . .: , 2006. 896.
14. . ++. / . . : , , 2006. 1104.
15. . . / . . . .: - - ʻ, 1992. 304 .
16. . . Microsoft Word 2010 / . . . .: BHV--, 2011. 560 .
