代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/431659/8663409
txt prime_algorithm.m.txt
Prime算法Matlab源代码
%Prims Algorithm
clc
fid = fopen('testfile1.txt', 'r'); % Input file
%Input file should be in the form of a text file.
%5 %order of matrix
%0 2 3 4 0
%2
www.eeworm.com/read/287166/8714048
c win_dbg.c
// Emacs style mode select -*- C++ -*-
//-----------------------------------------------------------------------------
//
// $Id: win_dbg.c,v 1.8 2001/01/25 22:15:45 bpereira Exp $
//
// Copyr
www.eeworm.com/read/386485/8741122
c cjpeg.c
/*
* cjpeg.c
*
* Copyright (C) 1991-1998, Thomas G. Lane.
* This file is part of the Independent JPEG Group's software.
* For conditions of distribution and use, see the accompanying README file.
www.eeworm.com/read/430329/8755971
m sima1.m
function [nw,a1,i] = sima1(w,p,lr,rho,pf)
%SIMA1 ART1 simulation function.
% Each input vector is presented to the network one at a time.
% (See COMPET, HARDLIM)
%
% [NW,A1,
www.eeworm.com/read/386253/8759845
m alg072.m
% GAUSS-SEIDEL ITERATIVE TECHNIQUE ALGORITHM 7.2
%
% To solve Ax = b given an initial approximation x(0).
%
% INPUT: the number of equations and unknowns n; the entries
% A(I,J), 1
www.eeworm.com/read/386253/8759847
m alg044.m
% DOUBLE INTEGAL ALGORITHM 4.4
%
% To approximate I = double integral ( ( f(x,y) dy dx ) ) with limits
% of integration from a to b for x and from c(x) to d(x) for y:
%
% INPUT: endpoint
www.eeworm.com/read/386253/8759863
m alg066.m
% CHOLESKI'S ALGORITHM 6.6
%
% To factor the positive definite n by n matrix A into LL**T,
% where L is lower triangular.
%
% INPUT: the dimension n; entries A(I,J), 1
www.eeworm.com/read/386253/8759909
m alg025.m
% METHOD OF FALSE POSITION ALGORITHM 2.5
%
% To find a solution to f(x) = 0 given the continuous function
% f on the interval [p0,p1], where f(p0) and f(p1) have
% opposite signs:
%
% INP
www.eeworm.com/read/386253/8759930
m alg035.m
% CLAMPED CUBIC SPLINE ALGORITHM 3.5
%
% To construct the cubic spline interpolant S for the function f,
% defined at the numbers x(0) < x(1) < ... < x(n), satisfying
% S'(x(0)) = f'(x(0)) an
www.eeworm.com/read/386253/8759942
m alg103.m
% STEEPEST DESCENT ALGORITHM 10.3
%
% To approximate a solution P to the minimization problem
% G(P) = MIN( G(X) : X in R(n) )
% given an initial approximation X:
%
% INPUT: Num