[kadaj6]

Hi, ineed to analize some bubble sort algorithms for a special project, and calculate the probability of each, while, if, for statements. Please help me

[ipushmycar]

special project.. homework.

What language is it in?
Have you written the bubblesort yet?

[kadaj6]

Its on matlab, ill write them down for u

[kadaj6]

function [S] = bubblesortWMem(X)
% Bubble sort implementation with memory
len = length(X);
S=X;
% t0=tic;
sorted = false;
last=1;
while (~sorted)
    sorted = true;
    
    for i=last:len-1
        if S(i) > S(i+1)
            tmp = S(i);
            S(i) = S(i+1);
            S(i+1) = tmp;
            sorted = false;
            last=i;
        end
    end
end
% t1=toc;
% runtime = t0-t1;

function [S] = bubblesortSE(X)
% Bubble sort implementation with Stop Early
len = length(X);
S=X;
% t0=tic;
sorted = false;
while (~sorted)
    sorted = true;
    for i=1:len-1
        if S(i) > S(i+1)
            tmp = S(i);
            S(i) = S(i+1);
            S(i+1) = tmp;
            sorted = false;
            break
        end
    end
end
% t1=toc;
% runtime = t0-t1;

function [S] = bubblesort(X)
% Bubble sort implementation
len = length(X);
S=X;
% t0=tic;
sorted = false;
while (~sorted)
    sorted = true;
    for i=1:len-1
        if S(i) > S(i+1)
            tmp = S(i);
            S(i) = S(i+1);
            S(i+1) = tmp;
            sorted = false;
        end
    end
end
% t1=toc;
% runtime = t0-t1;

function [S] = bubblesortWMemSe(X)
% Bubble sort implementation with memory and Stop Early
len = length(X);
S=X;
% t0=tic;
sorted = false;
last=1;
while (~sorted)
    sorted = true;
    
    for i=last:len-1
        if S(i) > S(i+1)
            tmp = S(i);
            S(i) = S(i+1);
            S(i+1) = tmp;
            sorted = false;
            last=i;
            break
        end
    end
end
% t1=toc;
% runtime = t0-t1

Its 4 different codes

This post has been edited by macosxnerd101: 14 December 2012 - 12:12 PM
Reason for edit:: Please use code tags

[kadaj6]

Please help

[Skydiver]

What do you mean by calculate the probability of each while, if, and for statement?

Doesn't the fact that a particular keyword exists in an implementation indicate that it has a probability of 100%?

[macosxnerd101]

Algorithms aren't analyzed based on the probability of an if statement, but rather on their efficiency. Bubblesort has a runtime complexity of O(n^2), regardless of your implementations.