divider.m

来自「时间序列的时频分析工具箱」· M 代码 · 共 25 行

M
25
字号
function [N,M]=divider(N1);
%DIVIDER Find dividers of an integer.  
%	[N,M]=DIVIDER(N1) find two integers N and M such that M*N=N1 and
%	M and N as close as possible from sqrt(N1).
%
%	Example :
%	 N1=258; [N,M]=divider(N1)

%	F. Auger - November 1995.
%	Copyright (c) 1996 by CNRS (France).
%
%	------------------- CONFIDENTIAL PROGRAM -------------------- 
%	This program can not be used without the authorization of its
%	author(s). For any comment or bug report, please send e-mail to 
%	f.auger@ieee.org 

N=floor(sqrt(N1));
cont=1.0;
while cont,
 Nold=N;
 M=ceil(N1/N);
 N=floor(N1/M);
 cont=(N~=Nold);
end;

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?