Scribd Logo
Upload

Welcome to Scribd!

  • Tri Fusion: M (D+F) /2 Trifusion (T, D, M) Trifusion (T, M+1, F) Fusionner (T, D, M, F) ) )

    Uploaded by

    leptdre
    19 views1 page
    TriFusion is a recursive algorithm that sorts an array of integers. It takes in an array, starting index, and ending index. It finds the midpoint of the subarray, recursively calls itself on the left and right halves, and then calls Fusionner to merge the sorted halves. Fusionner uses a temporary array to merge the left and right sorted runs by comparing elements and copying into the temporary array in sorted order, then copying back to the original array.

    Original Description:

    Original Title

    Tri Fusion

    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
    TriFusion is a recursive algorithm that sorts an array of integers. It takes in an array, starting index, and ending index. It finds the midpoint of the subarray, recursively calls itself on the left and right halves, and then calls Fusionner to merge the sorted halves. Fusionner uses a temporary array to merge the left and right sorted runs by comparing elements and copying into the temporary array in sorted order, then copying back to the original array.

    Copyright:

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

    Tri Fusion: M (D+F) /2 Trifusion (T, D, M) Trifusion (T, M+1, F) Fusionner (T, D, M, F) ) )

    Uploaded by

    leptdre
    TriFusion is a recursive algorithm that sorts an array of integers. It takes in an array, starting index, and ending index. It finds the midpoint of the subarray, recursively calls itself on the left and right halves, and then calls Fusionner to merge the sorted halves. Fusionner uses a temporary array to merge the left and right sorted runs by comparing elements and copying into the temporary array in sorted order, then copying back to the original array.

    Copyright:

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

    TRI FUSION

    UMLV

    void TriFusion (int t[], int d, int f){


    int m;
    if(d<f){
    m = (d+f)/2;
    TriFusion(t,d,m);
    TriFusion(t,m+1,f);
    Fusionner(t,d,m,f);}}
    void Fusionner (int t[], int d, int m, int f){
    int temp[f-d+1], i = d, j = m+1, k = 0;
    while(i<=m && j<=f){
    if(t[i]<=t[j]){temp[k]=t[i]; i++;}
    else{temp[k]=t[j]; j++;}
    k++;}
    while(j<=f){temp[k]=t[j]; j++; k++;}
    while(i<=m){temp[k]=t[i]; i++; k++;}
    for(i=0;i<=f-d;i++)t[i+d]=temp[i];}
    0

    You might also like