1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
uses GraphABC;
type point=record
x,y:integer;
end;
procedure plitk(x,y,r:integer);
var p:array[1..9]of point;
a,da:real;
i:byte;
begin
a:=pi/2;
da:=pi/4;
for i:=1 to 9 do
begin
p[i].x:=x+round(r*cos(a));
p[i].y:=y-round(r*sin(a));
a:=a+da;
end;
polygon(p,9);
end;
var r,i,j,x,y,d:integer;
begin
r:=20;
y:=r;
while y<=windowheight do
begin
x:=r;
while x<=windowwidth do
begin
plitk(x,y,r);
x:=x+2*r;
end;
y:=y+2*r
end;
end
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
template <typename T>
void PrintVec(const std::vector<T>& vec)
{
for (const auto& el : vec)
{
std::cout << el << " ";
}
}
int main()
{
std::vector<char> charVec = { 'a', 's', 'd', 'c' };
std::cout << "Input char vector: ";
PrintVec(charVec);
std::cout << std::endl;
std::sort(charVec.begin(), charVec.end()); // стандартная сортировка; сложность: O(N·log(N))
std::cout << "Sorted char vector: ";
PrintVec(charVec);
std::cout << std::endl;
system("pause");
return 0;
}