代码搜索：stdlib
找到约 10,000 项符合「stdlib」的源代码
代码结果 10,000
www.eeworm.com/read/167125/9980242
c 冒泡排序.c
# include "stdio.h"
# include "stdlib.h"
struct node{
int values;
struct node *next;
};
struct node *create(int [],int);
void sort (struct node **)
www.eeworm.com/read/166559/10016520
c libwavelet.c
#include "stdlib.h"
#include "stdio.h"
#include "math.h"
//---------------------------------------------------------------------------
//单层小波变换
//输入：
// num: 数据点的个数
// value: 数据
www.eeworm.com/read/165536/10058454
c border.c
/*
* BORDER.C - Sets the colors of the border.
*
*
* PROGRAMMER: Martti Ylikoski
* CREATED: 21.2.1991
* VERSION: 1.0
*
*/
#include
#include
#include
www.eeworm.com/read/360251/10105776
c cerrexit.c
/* cerrexit.c - cerrexit */
#include
#include
#include
#include
#include "local.h"
/*--------------------------------------------------------------------
www.eeworm.com/read/359809/10124062
c process.c
/****************************************
说明：公共执行过程
****************************************/
#include "at89x52.h"
#include "process.h"
#include
//
extern void c51_initialize
www.eeworm.com/read/358682/10182153
cpp count.cpp
// count.cpp -- counting characters in a list of files
#include
#include
#include // or stdlib.h
// #include // for Macintosh
int main(int
www.eeworm.com/read/358682/10182173
cpp append.cpp
// append.cpp -- appending information to a file
#include
#include
#include
#include // (or stdlib.h) for exit()
const char * file = "guests.txt";
www.eeworm.com/read/358191/10194610
h awdgraph.h
// file awdgraph.h
// adjacency matrix representation of a directed weighted graph
// initial version
#ifndef AdjacencyWDigraph_
#define AdjacencyWDigraph_
#include
#include
www.eeworm.com/read/357852/10200063
cpp shoppinglist-test.cpp
#include
#include
#include
#include
#include
#include "shoppinglist.h"
void loadShoppingList(ShoppingList& slst) {
bool ok;
Q
www.eeworm.com/read/357734/10202004
cpp strarray.cpp
// strarray.cpp
#include "stdafx.h"
#include "strarray.h"
#include
#include
#include
// -------------------------------------------------------------
cons