Void main()
{
int
n=7;
//int
mass[7]={4,9,7,6,2,3,8};
cout<<"Enter
amount of elements N: ";
cin>>n;
int
*mass=new
int[n];
for
(int
i=0; i<n; i++)
mass[i]=-100+rand()%200;
print(mass,n);
QuickSort(mass,0,n-1);
print(mass,n);
}
Задача 13:
#include
<iostream>
#include
<stdlib.h>
using
namespace
std;
template
<class
T> void
QuickSort (T *Mass, long
N)
{
long
i=0,j=N;
T
p;
p=Mass[N>>1];
do
{
while
(Mass[i]<p) i++;
while
(Mass[j]>p) j--;
if
(i<=j)
{
T
temp;
temp=Mass[i];
Mass[i]=Mass[j];
Mass[j]=temp;
i++;
j--;
}
}
while
(i<=j);
if
(j>0)
QuickSort(Mass,j);
if
(N>i)
QuickSort(Mass+i,N-i);
}
template
<class
T> void
print(T *Mass,int
n)
{
for
(int
i=0; i<n; i++)
cout<<Mass[i]<<"
";
cout<<"\n-----------------\n";
}
Void main()
{
int
n=7;
cout<<"Enter
amount of elements N: ";
cin>>n;
int
*IntMass=new
int[n];
//
for
(int
i=0; i<n; i++) //Realiz
IntMass[i]=-100+rand()%200;
//
float
*FloatMass=new
float[n];
//
for
(int
i=0; i<n; i++) //
FloatMass[i]=-100+(float)rand()/200;
//
print(IntMass,n);
print(FloatMass,n);
QuickSort(IntMass,n-1);
QuickSort(FloatMass,n-1);
print(IntMass,n);
print(FloatMass,n);
}
