% Name:FFTp
clear
N=8;%input('Type in the DFT length N=');
M=log2(N);
n=0:N-1;
x=[0 1 2 3 4 5 6 7];%input('Type in the sequence x(n)=');

% 
k=1:M-1;
x1=zeros(1,N);
x1(1)=x(1);
x1(N)=x(N);
J=0;
for I=1:N-2;
    if J>=N/2;
        J=J-N/2;
        if J>=N/4;
            J=J-N/4;
            if J>=N/8;
                J=J-N/8;
            else J=J+N/8;
            end
        else J=J+N/4;
        end
    else J=J+N/2;
    end    
    x1(I+1)=x(J+1);
end
x1
%

J=0;
for I=1:N-2;
    k=1;s=0;
    while k~=M+1|s~=1;
            if J>=N/(2.^k);
                J=J-N/(2.^k);
            else J=J+N/(2.^k);s=1;                
            end
            k=k+1;
            
        end
        J
x1(I+1)=x(J+1);
end
x1