Scribd Logo
Upload

Welcome to Scribd!

  • 26 views

    10-Dars. Tartiblash Algoritmlari

    Uploaded by

    abdulaziz
    The document discusses three sorting algorithms: selection sort, insertion sort, and bubble sort. It provides pseudocode to implement each algorithm and examples of sorting sample arrays using each algorithm. It also provides exercises to trace the steps of sorting arrays using each algorithm in Excel.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    10-Dars. Tartiblash Algoritmlari

    Uploaded by

    abdulaziz
    26 views24 pages
    The document discusses three sorting algorithms: selection sort, insertion sort, and bubble sort. It provides pseudocode to implement each algorithm and examples of sorting sample arrays using each algorithm. It also provides exercises to trace the steps of sorting arrays using each algorithm in Excel.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses three sorting algorithms: selection sort, insertion sort, and bubble sort. It provides pseudocode to implement each algorithm and examples of sorting sample arrays using each algorithm. It also provides exercises to trace the steps of sorting arrays using each algorithm in Excel.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    26 views24 pages

    10-Dars. Tartiblash Algoritmlari

    Uploaded by

    abdulaziz
    The document discusses three sorting algorithms: selection sort, insertion sort, and bubble sort. It provides pseudocode to implement each algorithm and examples of sorting sample arrays using each algorithm. It also provides exercises to trace the steps of sorting arrays using each algorithm in Excel.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 24

    Tartiblash algoritmlari

    Reja:

    • Tartiblash algoritmlari haqida

    • SELECTION SORT

    • INSERTION SORT

    • BUBBLE SORT

    • Amaliy mashqlar
    Tartiblash algoritmlari
    SELECTION SORT
    void selectionSort(int arr[], int n)
    {
    int i, j, min_idx;

    // One by one move boundary of unsorted subarray


    for (i = 0; i < n-1; i++)
    {
    // Find the minimum element in unsorted array
    min_idx = i;
    for (j = i+1; j < n; j++)
    if (arr[j] < arr[min_idx])
    min_idx = j;

    // Swap the found minimum element with the first element


    swap(arr[min_idx], arr[i]);
    }
    }
    /* Function to print an array */
    void printArray(int arr[], int size)
    {
    int i;
    for (i=0; i < size; i++)
    cout << arr[i] << " ";
    cout << endl;
    }
    int main()
    {
    int arr[] = {64, 25, 12, 22, 11};
    int n = sizeof(arr)/sizeof(arr[0]);

    selectionSort(arr, n);

    cout << "Sorted array: ";


    printArray(arr, n);

    return 0;
    }
    INSERTION SORT
    /* Function to sort an array using insertion sort*/
    void insertionSort(int arr[], int n)
    {
    int i, key, j;
    for (i = 1; i < n; i++)
    {
    key = arr[i];
    j = i - 1;

    /* Move elements of arr[0..i-1], that are


    greater than key, to one position ahead
    of their curent position */
    while (j >= 0 && arr[j] > key)
    {
    arr[j + 1] = arr[j];
    j = j - 1;
    }
    arr[j + 1] = key;
    }
    }
    /* Function to print an array */
    void printArray(int arr[], int size)
    {
    int i;
    for (i=0; i < size; i++)
    cout << arr[i] << " ";
    cout << endl;
    }
    int main()
    {
    int arr[] = { 12, 11, 13, 5, 6 };
    int n = sizeof(arr) / sizeof(arr[0]);
    insertionSort(arr, n);

    printArray(arr, n);

    return 0;
    }
    BUBBLE SORT
    // 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;
    }
    int main()
    {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);

    bubbleSort(arr, n);

    cout<<"Sorted array: ";


    printArray(arr, n);

    return 0;
    }
    Amaliy mashqlar
    Butun sonlardan iborat 7 ta elementli massiv berilgan.
    Massiv elementlari tasodifiy sonlar generatori yordamida
    aniqlanadi.

    Massiv elementlarini o’sish tartibida tartiblash uchun


    SELECTION SORT asosida har bir qadamni alohida-alohida
    Excel dasturida yozing.
    Butun sonlardan iborat 7 ta elementli massiv berilgan.
    Massiv elementlari tasodifiy sonlar generatori yordamida
    aniqlanadi.

    Massiv elementlarini o’sish tartibida tartiblash uchun


    INSERTION SORT asosida har bir qadamni alohida-alohida
    Excel dasturida yozing.
    Butun sonlardan iborat 7 ta elementli massiv berilgan.
    Massiv elementlari tasodifiy sonlar generatori yordamida
    aniqlanadi.

    Massiv elementlarini o’sish tartibida tartiblash uchun


    BUBBLE SORT asosida har bir qadamni alohida-alohida
    Excel dasturida yozing.
    E`tiboringiz uchun
    rahmat!

    You might also like