登录
首页 » Visual C++ » m-in

m-in

于 2008-09-25 发布 文件大小:6KB
0 215
下载积分: 1 下载次数: 0

代码说明:

说明:  数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 123
    中科大数据结构全部上机实验的实验程序以及报告,内容包括多项式,图,栈,SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
    2020-10-14 19:57:30下载
    积分:1
  • CAR
    some problems about c++.(car.cpp)
    2012-01-12 14:39:48下载
    积分:1
  • basika
    经典算法巴斯卡三角的简单实现,vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)
    2012-10-30 13:22:26下载
    积分:1
  • expression
    利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
    2011-10-30 14:14:01下载
    积分:1
  • data_structure
    数据结构c源代码实现,大概有100个左右,基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)
    2012-07-19 21:43:52下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • Tic-tac-toe-chess
    C语言实现井字棋博弈的过程,采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)
    2012-05-20 23:15:48下载
    积分:1
  • Bigint
    利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
    2007-10-18 21:34:06下载
    积分:1
  • mofanwenti
    魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)
    2014-01-08 22:30:48下载
    积分:1
  • Tetris
    使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
    2013-03-27 10:51:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载