|
Chiqish
Saralangan massiv: 1 2 4 5 8
Vaqt murakkabligi
|
| bet | 3/16 | | Sana | 15.11.2023 | | Hajmi | 29,81 Mb. | | #99092 |
Bog'liq Dilshoda Algoritm mustaqilChiqish
Saralangan massiv: 1 2 4 5 8
Vaqt murakkabligi: O(N 2 )
Yordamchi fazo: O(1)
Bubble Saralashning optimallashtirilgan amalga oshirilishi:
Yuqoridagi funktsiya massiv tartiblangan bo'lsa ham har doim O(N 2 ) vaqtida ishlaydi. Agar ichki tsikl hech qanday almashtirishga olib kelmasa, algoritmni to'xtatish orqali optimallashtirish mumkin.
Quyida yuqoridagi yondashuvni amalga oshirish ko'rsatilgan:
// Optimized C# implementation
// of Bubble sort
using System;
class GFG
{
// An optimized version of Bubble Sort
static void bubbleSort(int []arr, int n)
{
int i, j, temp;
bool swapped;
for (i = 0; i < n - 1; i++)
{
swapped = false;
for (j = 0; j < n - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
// swap arr[j] and arr[j+1]
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
swapped = true;
}
}
// IF no two elements were
// swapped by inner loop, then break
if (swapped == false)
break;
}
}
// Function to print an array
static void printArray(int []arr, int size)
{
int i;
for (i = 0; i < size; i++)
Console.Write(arr[i] + " ");
Console.WriteLine();
}
// Driver method
public static void Main()
{
int []arr = {64, 34, 25, 12, 22, 11, 90};
int n = arr.Length;
bubbleSort(arr,n);
Console.WriteLine("Sorted array");
printArray(arr,n);
}
}
|
| |
