بسم الله الرحمن الرحيم
السلام عليكم
وبعد
يعطيك الصحة و العافية و السعادة و التفوق في حياتك العلمية و العملية
جزاك الله كل الخير أخي في الله
وهذه الكودات هي لجميع أنواع الفرز
1- الفرز الفقاعي
#include<iostream.h>
#include<windows.h>
void bubbleSort(int numbers[], int array_size)
{
int i, j, temp;
for (i = (array_size - 1); i >= 0; i--)
{
for (j = 1; j <= i; j++)
{
if (numbers[j-1] > numbers[j])
{
temp = numbers[j-1];
numbers[j-1] = numbers[j];
numbers[j] = temp;
}
}
}
}
void main()
{
const int size=10;
int Array;
for(int i=0;i<size;i++)
Array[i]=rand();
srand(Array[i]);
int x1=GetTickCount();
bubbleSort(Array,size);
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
int x2=GetTickCount();
cout<<"the result:"<<x2-x1<<endl;
}
2- الفرز بالكومة
#include<iostream.h>
#include<windows.h>
void siftDown(int numbers[], int root, int bottom)
{
int done, maxChild, temp;
done = 0;
while ((root*2 <= bottom) && (!done))
{
if (root*2 == bottom)
maxChild = root * 2;
else if (numbers[root * 2] > numbers[root * 2 + 1])
maxChild = root * 2;
else
maxChild = root * 2 + 1;
if (numbers[root] < numbers[maxChild])
{
temp = numbers[root];
numbers[root] = numbers[maxChild];
numbers[maxChild] = temp;
root = maxChild;
}
else
done = 1;
}
}
void heapSort(int numbers[], int array_size)
{
int i, temp;
for (i = (array_size / 2)-1; i >= 0; i--)
siftDown(numbers, i, array_size);
for (i = array_size-1; i >= 1; i--)
{
temp = numbers[0];
numbers[0] = numbers[i];
numbers[i] = temp;
siftDown(numbers, 0, i-1);
}
}
void main()
{
const int size=10;
int Array[size];
for(int i=0;i<size;i++)
Array[i]=rand();
int x1=GetTickCount();
heapSort(Array,size);
int x2=GetTickCount();
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
cout<<"the result is:"<<x2-x1;
}
3-الفرز بالإقحام
#include<iostream.h>
#include<windows.h>
void insertionSort(int numbers[], int array_size)
{
int i, j, index;
for (i=1; i < array_size; i++)
{
index = numbers[i];
j = i;
while ((j > 0) && (numbers[j-1] > index))
{
numbers[j] = numbers[j-1];
j = j - 1;
}
numbers[j] = index;
}
}
void main()
{
const int size=10;
int Array[size];
for (int i=0;i<size;i++)
{
Array[i]=rand();
}
int x1=GetTickCount();
insertionSort(Array,size);
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
int x2=GetTickCount();
cout<<"the result:"<<x2-x1<<endl;
}
4-الفرز بالدمج
#include<iostream.h>
#include<windows.h>
void merge(int numbers[], int temp[], int left, int mid, int right)
{
int i, left_end, num_elements, tmp_pos;
left_end = mid - 1;
tmp_pos = left;
num_elements = right - left + 1;
while ((left <= left_end) && (mid <= right))
{
if (numbers[left] <= numbers[mid])
{
temp[tmp_pos] = numbers[left];
tmp_pos = tmp_pos + 1;
left = left +1;
}
else
{
temp[tmp_pos] = numbers[mid];
tmp_pos = tmp_pos + 1;
mid = mid + 1;
}
}
while (left <= left_end)
{
temp[tmp_pos] = numbers[left];
left = left + 1;
tmp_pos = tmp_pos + 1;
}
while (mid <= right)
{
temp[tmp_pos] = numbers[mid];
mid = mid + 1;
tmp_pos = tmp_pos + 1;
}
for (i=0; i <= num_elements; i++)
{
numbers[right] = temp[right];
right = right - 1;
}
}
void m_sort(int numbers[], int temp[], int left, int right)
{
int mid;
if (right > left)
{
mid = (right + left) / 2;
m_sort(numbers, temp, left, mid);
m_sort(numbers, temp, mid+1, right);
merge(numbers, temp, left, mid+1, right);
}
}
void mergeSort(int numbers[], int temp[], int array_size)
{
m_sort(numbers, temp, 0, array_size - 1);
}
void main()
{
const int size=10;
int Array[size];
for(int i=0;i<size;i++)
Array[i]=rand();
int temp[size];
int x1=GetTickCount();
mergeSort(Array,temp,size);
int x2=GetTickCount();
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
cout<<"the result is:"<<x2-x1<<endl;
}
5- الفرز السريع ط1
#include<iostream.h>
#include<windows.h>
void q_sort(int numbers[], int left, int right)
{
int pivot, l_hold, r_hold;
l_hold = left;
r_hold = right;
pivot = numbers[left];
while (left < right)
{
while ((numbers[right] >= pivot) && (left < right))
right--;
if (left != right)
{
numbers[left] = numbers[right];
left++;
}
while ((numbers[left] <= pivot) && (left < right))
left++;
if (left != right)
{
numbers[right] = numbers[left];
right--;
}
}
numbers[left] = pivot;
pivot = left;
left = l_hold;
right = r_hold;
if (left < pivot)
q_sort(numbers, left, pivot-1);
if (right > pivot)
q_sort(numbers, pivot+1, right);
}
void quickSort(int numbers[], int array_size)
{
q_sort(numbers, 0, array_size - 1);
}
void main()
{
const int size=10;
int Array[size];
for(int i=0;i<size;i++)
Array[i]=rand();
int x1=GetTickCount();
quickSort(Array,size);
int x2=GetTickCount();
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
cout<<"the result is:"<<Array[i]<<endl;
}
ط2
#include<iostream.h>
#include<windows.h>
void swap(int &a,int &b)
{
int temp=a;
a=b;
b=temp;
}
int Pivote(int A[],int p,int q)
{
int x=A[p];
int i=p;
for(int j=p+1;j<=q;j++)
{
if (A[j]<=x)
{
i++;
swap(A[i],A[j]);
}
}
swap(A[p],A[i]);
return i;
}
void QuickSort(int x[],int low,int high)
{
if (low<high)
{
int p=Pivote(x,low,high);
QuickSort(x,low,p-1);
QuickSort(x,p+1,high);
}
}
void main()
{
const int size=10;
int Array[size];
srand(3);
for(int i=0;i<size;i++)
{
Array[i]=rand();
}
int x1=GetTickCount();
QuickSort(Array,0, size-1);
int x2=GetTickCount();
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
cout<<"the result is:"<<x2-x1<<endl;
}
6-الفرز بالاختيار أو الانتخاب
#include<iostream.h>
#include<windows.h>
void selectionSort(int numbers[], int array_size)
{
int i, j;
int min, temp;
for (i = 0; i < array_size-1; i++)
{
min = i;
for (j = i+1; j < array_size; j++)
{
if (numbers[j] < numbers[min])
min = j;
}
temp = numbers[i];
numbers[i] = numbers[min];
numbers[min] = temp;
}
}
void main()
{
const int size=10;
int Array[size];
for(int i=0;i<size;i++)
Array[i]=rand();
int x1=GetTickCount();
selectionSort(Array,size);
int x2=GetTickCount();
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
cout<<"the result is:"<<Array[i]<<endl;
}
7- الفرز الصدفي
#include<iostream.h>
#include<windows.h>
void shellSort(int numbers[], int array_size)
{
int i, j, increment, temp;
increment = 3;
while (increment > 0)
{
for (i=0; i < array_size; i++)
{
j = i;
temp = numbers[i];
while ((j >= increment) && (numbers[j-increment] > temp))
{
numbers[j] = numbers[j - increment];
j = j - increment;
}
numbers[j] = temp;
}
if (increment/2 != 0)
increment = increment/2;
else if (increment == 1)
increment = 0;
else
increment = 1;
}
}
void main()
{
const int size=10;
int Array[size];
for(int i=0;i<size;i++)
Array[i]=rand();
int x1=GetTickCount();
shellSort(Array,size);
int x2=GetTickCount();
for(i=0;i<size;i++)
cout<<Array[i]<<endl;
cout<<"the result is:"<<Array[i]<<endl;
}
أرجو الفائدة بالإشارة إلى أن الكودات مجربة و أرجو التنبيه للخطأ
[SIZE=4]و السلام عليكم