代码搜索：complexity
找到约 493 项符合「complexity」的源代码
代码结果 493
www.eeworm.com/read/182900/9186902
m designhbf.m
function [f1_saved,f2_saved,info]=designHBF(fp,delta,debug)
%function [f1,f2,info]=designHBF(fp=0.2,delta=1e-5,debug=0)
%Design a half-band filter which can be realized without general multipliers.
%T
www.eeworm.com/read/162609/10291392
c wmops.c
/*
2.4 kbps MELP Proposed Federal Standard speech coder
Fixed-point C code, version 1.0
Copyright (c) 1998, Texas Instruments, Inc.
Texas Instruments has intellectual property rights on
www.eeworm.com/read/418151/10964466
m designhbf.m
function [f1_saved,f2_saved,info]=designHBF(fp,delta,debug)
%function [f1,f2,info]=designHBF(fp=0.2,delta=1e-5,debug=0)
%Design a half-band filter which can be realized without general multipliers.
%T
www.eeworm.com/read/333524/12677726
m designhbf.m
function [f1_saved,f2_saved,info]=designHBF(fp,delta,debug)
%function [f1,f2,info]=designHBF(fp=0.2,delta=1e-5,debug=0)
%Design a half-band filter which can be realized without general multipliers.
%T
www.eeworm.com/read/126074/6018277
c rulepsr.c
/*******************************************************/
/* "C" Language Integrated Production System */
/* */
/*
www.eeworm.com/read/124399/6049528
c rulepsr.c
/*******************************************************/
/* "C" Language Integrated Production System */
/* */
/*
www.eeworm.com/read/221024/14767068
html http:^^www.cs.cornell.edu^info^department^annual95^faculty^hartmanis.html
MIME-Version: 1.0
Server: CERN/3.0
Date: Wednesday, 20-Nov-96 18:58:21 GMT
Content-Type: text/html
Content-Length: 4852
Last-Modified: Thursday, 30-Nov-95 21:21:10 GMT
Jur
www.eeworm.com/read/168085/5448404
c wmops.c
/*
2.4 kbps MELP Proposed Federal Standard speech coder
Fixed-point C code, version 1.0
Copyright (c) 1998, Texas Instruments, Inc.
Texas Instruments has intellectual property rights on
www.eeworm.com/read/167185/5462905
tm
set lang='Ada'
set metrics='Complexity'
set src=''
set opcode='Ok'
www.eeworm.com/read/266538/11219996
cpp annoying.cpp
// Author: Adrian Kuegel
// Date: 15. 6. 2007
// Algorithm: greedy
// Complexity: O(r*(n-r)*c*(m-c))
#include
#include
char p[128][131];
int main() {
FILE *in = fopen("annoyin