Mavzu: Piramidali saralash algoritmlari Mundarija

Amaliy bo’lmagan saralash
1. Bogosort – algoritmmurakkabligi O(n n!).
2. O’rinlashtirishsaralash – algoritmmurakkabligi O(n n!).
3. Ma’nosizsaralash (Stupid sort) – algoritmmurakkabligi O(n ³ ).
4. Bead asort – Algoritmmurakkabligi O(n) yoki O(sqrt(n)). Maxsusapparatta’minotitalabetiladi.
5. Quymoqli saralash (Pancake sorting) – Algoritm murakkabligi O(n).Maxsus apparat ta’minoti talab etiladi.
Ko’rib turubsiz saralash algaritimlari juda ko’p turlari mavjud. Shulardan ba’zi birlari birlari bilan tanishib chi qamiz.

II. Bob. Saralash algoritmlarining dasturlash tillaridagi tahlili

2.1.C++ dasturlash tilida saralash.

C++ da saralash juda oddiy Quick Sort bo’yicha saralaydi:
#include
#include
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for (int i = 0; i < n; i++)
cin>>a[i];
sort(a, a+n);
for (int i = 0; i < n; i++)
cout<return 0;
}
// C++ program for implementation of Bubble sort
#include
using namespace std;
 
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
 
// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
int i, j;
for (i = 0; i < n-1; i++)

// Last i elements are already in place
for (j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
swap(&arr[j], &arr[j+1]);
}
 /* Function to print an array */
void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}
 // Driver code
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
cout<<"Sorted array: \n";
printArray(arr, n);
return 0;
}