إ₰...👨🏻‍💻CODE👩🏻‍💻...₰❥

#selection_sort

خوارزمية الترتيب بالأختيار

#include <iostream>
using namespace std;

void selectionSort(int arr[], int Size)
{
int min, i, j, temp;

for (i = 0; i < Size; i++)
{
min = i;

for (j = i + 1; j < Size; j++)
{
if (arr[j] < arr[min])
min = j;
}

temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}


void printArray(int arr[], int Size)
{
for (int i = 0; i < Size; i++)
{
cout << arr[i] << " ";
}

cout << endl;
}



int main()
{
int arr[10] = {2, 5, 4, 3, 8, 1, 9, 0, 7, 6};
int Size = sizeof(arr) / 4;

cout << "Array befor sorted....\n";
printArray(arr, Size);

selectionSort(arr, Size);

cout << "Array after sorted....\n";
printArray(arr, Size);

return 0;
}

•┈┈┈•❈••✦✾✦••❈•┈┈┈•
❥➺┊ @barrmaja↷
•┈┈┈•❈••✦✾✦••❈•┈┈┈•


إ₰...Output....₰❥

Array befor sorted...
2 5 4 3 8 1 9 0 7 6 Array after sorted....
0 1 2 3 4 5 6 7 8 9 [Program finished]