noRepetitionRand.m

%   COPYRIGHT
%   This file is part of TSSA: https://github.com/ayrna/tssa
%   Original authors: Antonio M. Duran Rosal, Pedro A. Gutierrez
%   Copyright:
%       This software is released under the The GNU General Public License v3.0 licence
%       available at http://www.gnu.org/licenses/gpl-3.0.html
%   Citation: If you use this code, please cite any of the following papers:
%     [1] A.M. Durán-Rosal, P.A. Gutiérrez, S. Salcedo-Sanz and C. Hervás-Martínez.
%         "A statistically-driven Coral Reef Optimization algorithm for optimal
%         size reduction of time series", Applied Soft Computing, 
%         Vol. 63. 2018, pp. 139-153.
%         https://doi.org/10.1016/j.asoc.2017.11.037
%     [2] A.M. Durán-Rosal, P.A. Gutiérrez, S. Salcedo-Sanz and C. Hervás-Martínez.
%         "Dynamical Memetization in Coral Reef Optimization Algorithms
%         for Optimal Time Series Approximation",
%         Progress in Artificial Intelligence, Vol. 8, June, 2019, pp. 253-262.
%         https://doi.org/10.1007/s13748-019-00176-0
%     [3] A.M. Durán-Rosal, D. Guijo-Rubio, P.A. Gutiérrez, S. Salcedo-Sanz and C. Hervás-Martínez.
%         "A coral reef optimization algorithm for wave height time series segmentation problems".
%         International Work-Conference on Artificial and Natural Neural Networks (IWANN2017).
%         14th-16th June. 2017. Cádiz (Spain). LNCS, vol. 10305. pp. 673-684
%         https://doi.org/10.1007/978-3-319-59153-7_58
%
%% noRepetitionRand
% Function: Generate K number between imin - imax without repetition
% 
% Input:
%     imin:   minimum value of random generation
%     imax:   maximum value of random generation
%     K:      number of values to return
%     
% Output:
%     m:      random values without repetition
function [m] = noRepetitionRand(imin,imax,K)
    if (imax-imin < K)
        fprintf(' Error:excede el rango\n');
        m = NaN;
        return
    end

    n = 0; % counter of random numbers
    m = imin-1;
    while (n < K)
        a = randi([imin,imax],1);
        if ((a == m) == 0)
            m = [m, a];
            n = n+1;
        end
    end
    m = m(:,2:end);
end