Scribd Logo
Upload

Welcome to Scribd!

  • Quick Sort

    Uploaded by

    Yeison Montaña
    15 views1 page
    The document describes the steps of quicksort algorithm to sort an array A with 7 elements. It lists the initial array A, picks the first element as the pivot element, and partitions the array into left and right subsets based on the pivot value, leaving the pivot in its final sorted position. It repeats this process recursively on the left and right subsets until the entire array A is sorted in ascending order.

    Original Description:

    ejercico resuekto de Quick sort

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the steps of quicksort algorithm to sort an array A with 7 elements. It lists the initial array A, picks the first element as the pivot element, and partitions the array into left and right subsets based on the pivot value, leaving the pivot in its final sorted position. It repeats this process recursively on the left and right subsets until the entire array A is sorted in ascending order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views1 page

    Quick Sort

    Uploaded by

    Yeison Montaña
    The document describes the steps of quicksort algorithm to sort an array A with 7 elements. It lists the initial array A, picks the first element as the pivot element, and partitions the array into left and right subsets based on the pivot value, leaving the pivot in its final sorted position. It repeats this process recursively on the left and right subsets until the entire array A is sorted in ascending order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Sindy Tatiana Clavijo Bayona Código:191233

    0 1 2 3 4 5 6
    A 7 9 10 1 22 15 50
    A (1) 7 1 10 9 22 15 50
    A (1) 1 7 10 9 22 15 50
    A (2) 1 7 9 10 22 15 50
    A (3) 1 7 9 10 15 22 50
    Ordenado 1 7 9 10 15 22 50

    (1) Pivote = 7
    Izq = 0
    Der = 6
    I=012
    J=654321
    Aux = 9

    (2) Pivote = 10
    Izq = 2
    Der = 6
    I=23
    J=6543
    Aux =

    (3) Pivote = 22
    Izq = 4
    Der = 6
    I=456
    J=65
    Aux =

    You might also like