Scribd Logo
Upload

Welcome to Scribd!

  • Prueba de Escritorio Merge

    Uploaded by

    Johan Sebastian Perez Castañeda
    5 views3 pages
    This document describes the process of sorting an array of numbers using the merge sort algorithm. It shows the array being divided into halves and then merged back together after sorting each half. The steps displayed include sorting each half, merging the halves back together, and the final merged and sorted array.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes the process of sorting an array of numbers using the merge sort algorithm. It shows the array being divided into halves and then merged back together after sorting each half. The steps displayed include sorting each half, merging the halves back together, and the final merged and sorted array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views3 pages

    Prueba de Escritorio Merge

    Uploaded by

    Johan Sebastian Perez Castañeda
    This document describes the process of sorting an array of numbers using the merge sort algorithm. It shows the array being divided into halves and then merged back together after sorting each half. The steps displayed include sorting each half, merging the halves back together, and the final merged and sorted array.

    Copyright:

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

    JOHAN SEBASTIÁN PÉREZ- ORDENAMIENTO DE CÉDULA POR MERGE

    c []
    0 1 2 3 4 5 6 7 8 9
    1 0 0 6 7 7 5 5 3 3

    Sort left half: 0 1 2 3 4 5 6 7 8 9


    Sort(c,0,9) 1 0 0 6 7 7 5 5 3 3
    Sort(c,0,4) 1 0 0 6 7
    Sort(c,0,1) 1 0
    Merge(c,0,0,1) 0 1
    Sort(c,2,4) 0 6 7
    Sort(c,2,2) 0
    Merge(c,2,2,2) 0
    Sort(c,3,4) 6 7
    Merge(c,3,3,4) 6 7
    Merge(c,2,2,4) 0 6 7
    Merge(c,0,1,4) 0 1 0 6 7
    JOHAN SEBASTIÁN PÉREZ- ORDENAMIENTO DE CÉDULA POR MERGE

    Sort right half: 0 1 2 3 4 5 6 7 8 9


    Sort(c,5,9) 7 5 5 3 3
    Sort(c,5,6) 7 5
    Merge(c,5,5,6) 5 7
    Sort(c,7,9) 5 3 3
    Sort(c,7,7) 5
    Merge(c,7,7,7) 5
    Sort(c,8,9) 3 3
    Merge (8,8,9) 3 3
    Merge(c,7,7,9) 5 3 3

    Merge(c,5,6,9) 5 7 3 3 5
    JOHAN SEBASTIÁN PÉREZ- ORDENAMIENTO DE CÉDULA POR MERGE

    Merge(c,0,4,9) 0 0 1 6 7 3 3 5 5 7

    You might also like