代码搜索：Random
找到约 10,000 项符合「Random」的源代码
代码结果 10,000
www.eeworm.com/read/177211/9465057
m ldpc_generate.m
function [H] = generate(M,N,t,q,seed)
%[H] = generate(M,N,t,q,seed)
% generates sparse LDPC parity check matrix over GFq
% (first H for GF2 is generated, then elements of GFq are created at random)
www.eeworm.com/read/373250/9467587
m pick.m
function [i,j] = pick(ndx)
% PICK Pick an entry at random from a vector
% function [i,j] = pick(ndx)
%
% i = ndx(j) for j ~ U(1:length(ndx))
dist = normalize(ones(1,length(ndx)));
j = sample_d
www.eeworm.com/read/373036/9476938
c csort.c
/************************************************************************
名称： csort.c
一个动画程序来显示6个排序算法的动作。
运行这个程序要求包含
www.eeworm.com/read/176917/9479541
cpp 直接选择排序.cpp
#include
#include
#include
#include
const int n=100000;
typedef struct{
int key; //r[n+1];
int next;
}SLNode;
typedef struct
{
SLNode *r;
www.eeworm.com/read/176917/9479544
cpp 直接插入排序基本算法.cpp
#include
#include
#include
const int n=100000;
typedef struct{
int key;
}RedType;
typedef struct{
RedType *r; //r[n+1];
int length;
}SqList;
int
www.eeworm.com/read/176917/9479550
cpp 改进1.cpp
#include
#include
#include
const int n=100000;
typedef struct{
int key;
}RedType;
typedef struct{
RedType *r; //r[n+1];
int length;
}SqList;
int
www.eeworm.com/read/176712/9487328
i defns.i
/*************************************************************************/
/* */
/* Definitions used in C4.5 */
/* ------------------------ */
/* */
/*********
www.eeworm.com/read/176520/9495037
java yunchou1.java
import java.lang.*;
import javax.swing.JOptionPane;
public class YunChou1
{
public static void main(String args[])
{
String inputString;
String outputString;
i
www.eeworm.com/read/371229/9561027
v double_addsub_tb.v
// Copyright 2007 Altera Corporation. All rights reserved.
// Altera products are protected under numerous U.S. and foreign patents,
// maskwork rights, copyrights and other intellectual property
www.eeworm.com/read/371082/9569136
m ldpc_generate.m
function [H] = generate(M,N,t,q,seed)
%[H] = generate(M,N,t,q,seed)
% generates sparse LDPC parity check matrix over GFq
% (first H for GF2 is generated, then elements of GFq are created at random)