Search - array class

Search - array class - List

[Data structs] 大数的阶层 DL : 0: 用数组存储一个大数的阶层。输入一个整数n,先求出n!占用的位数。动态开辟bits位数组，用适当方法把n!的值存储到数组里去-storage arrays with a majority of the class. The importation of an integer n, first obtained n! The median occupancy. The median opening bits dynamic group, the use of appropriate means, n! The value of the storage array happened
Date : 2026-01-19 Size : 14kb User : 红苹果
[Data structs] removeDuplicates2 DL : 0: 上课的作业，是除去数组中的重复元素，利用数据结构常用算法-class operation is to remove duplication of array elements, the use of commonly used data structures Algorithm
Date : 2026-01-19 Size : 952kb User : 郎斐
[Data structs] 01 DL : 0: 第四章基本的类、字符串和动态数组第四章基本的类、字符串和动态数组.rar Symbian 60-Chapter IV of the basic class, string and dynamic array of Chapter IV of the basic categories, strings and dynamic arrays. Rar Symbian 60
Date : 2026-01-19 Size : 532kb User : hu
[Data structs] graph2M DL : 0: 程序首先给出边集数组中的元素类型、邻接矩阵类定义。其中，建立图的邻接矩阵CREATEMatrix函数的形参N为图的点数形参e为边数，rcw为结构体类型RCW的数组利用PRIM算法从定点V0出发求出用邻接矩阵GA表示的图的最小生成树，其边集存与数组CT中，PRIM算法对应的函数为PRIM。-First of all, given the procedures margination array element type, adjacency matrix class definition. Among them, the establishment of graph adjacency matrix CREATEMatrix function parameter N points for the map parameter e for the edge, rcw for the structure of the array type RCW use PRIM algorithm derived from the fixed point of departure V0 with adjacency matrix GA expressed Minimum Spanning Tree, and its margination CT in keeping with the array, PRIM algorithm corresponding function for the PRIM.
Date : 2026-01-19 Size : 3kb User : sjw87522
[Data structs] checkarray DL : 0: 设计一个用于检查数组在使用时下标是否越界的类，如越界给出提示。（知识点：下标运算符的重载）。-Used to check the design of a current array subscript is in the use of cross-border class, such as cross-border give tips. [Knowledge points: subscript operator overloading].
Date : 2026-01-19 Size : 5kb User : 王清
[Data structs] TsinghuaCdatastructures DL : 0: 清华+殷人昆C++数据结构幻灯片教学课件通过本课程的学习，应达到知识和技能两方面的目标： 1、知识方面：从数据结构的类定义和对象的使用，以及存储表示和操作的实现两个层次，系统地学习和掌握常用的基本数据结构（包括数组、顺序表、多项式、字符串、链表、栈与队列、优先级队列、广义表、树与森林、二叉树、堆、集合、图、搜索结构、索引结构、散列结构等）及其不同的实现，了解并掌握分析、比较和选择不同数据结构、不同存储结构、不同算法的原则和方法，为后续课程的学习打好基础。 -Tsinghua Queensland C++ data structures courseware slides Through the study of curriculum, knowledge and skills to achieve two objectives: 1, knowledge areas: data structure from the class definition and object use, and storage that implementation and operation of two levels, the system commonly used to study and master the basic data structure (including the array, the order form, polynomial, string , linked lists, stacks and queues, priority queues, generalized form, trees and forests, tree, heap, collection, map, search structures, index structures, hash structures, etc.) and their different implementation, understanding and skills analysis , compare and choose a different data structure, different storage structure, the principle of different algorithms and methods for follow-up study to lay the foundation of the curriculum.
Date : 2026-01-19 Size : 1.75mb User : ciweijsf
[Data structs] IntegerSort DL : 0: 设计一个由自动测试排序算法性能（比较次数compare_count、交换次数exchange_count、探测次数probe_count）的测试类和排序类构成的类体系。注：用一个类来描述一个排序算法，类中的sort方法通过调用比较、交换方法来实现数组排序。排序类放入一个特定的包MySort中。-Design a sorting algorithm by automatic test performance (compare the number of compare_count, the exchange of the number of exchange_count, to detect the number of probe_count) test category and constitute a sort of category system category. Note: The use of a class to describe a sorting algorithm, class by calling the sort method of comparison, the exchange of methods to achieve the sort array. Sorted into a specific category MySort in the package.
Date : 2026-01-19 Size : 8kb User : jay
[Data structs] mfc_misc DL : 0: 非常用用的mfc数组、链表排序辅助类，解决MFC的类不能排序的遗憾-Mfc is used with an array, linked list to sort helper class, the class can not solve the MFC sort of regret
Date : 2026-01-19 Size : 3kb User : xiaosong
[Data structs] class4-ctree DL : 0: 由一线性数组生成一个完全二叉树，使用类描述，有详细注释，完整的输入输出-By a linear array generates a complete binary tree, use the class descriptions, detailed notes, a complete input and output
Date : 2026-01-19 Size : 1kb User : wanglei
[Data structs] queue DL : 0: 数据结构实现：队列（环形数组、链式实现）的基类实现。-Data structure implementation: queue (circular array, chain to achieve) is the base class implementation.
Date : 2026-01-19 Size : 1kb User : Robin.Wang
[Data structs] FrameWorkMatrix DL : 0: 计算骨架阵的算法，数组是动态分配的，用类写的，有很好的封装性和移植性。并且输入时从文本文件TXT读取的！-Skeleton matrix calculation algorithm, the array is dynamically allocated, with the class to write, have a good package and portability. And input from a text file TXT read!
Date : 2026-01-19 Size : 2kb User : 沈大勇
[Data structs] data_struct6 DL : 0: 数据结构课后设计题第六章 6.33③ 假定用两个一维数组L[1..n]和R[1..n]作为有n个结点的二叉树的存储结构， L[i]和R[i]分别指示结点i的左孩子和右孩子，0表示空。试写一个算法判别结点u是否为结点v的子孙。-Data structure design question after class VI 6.33 ③ assumed with two one-dimensional array L [1 .. n] and R [1 .. n] as an n-node binary tree storage structure, L [i ] and R [i] i were instructions left child node and right child, 0 means empty. Try to write an algorithm to determine whether node u is node v' s descendants.
Date : 2026-01-19 Size : 3kb User : W.Y.T.S
[Data structs] Array DL : 0: 数组类的定义，自己写的，根据清华大学数据结构上面改编的-Array class definition, write, according to the above data structure adapted Tsinghua University
Date : 2026-01-19 Size : 2kb User : 陈根
[Data structs] 2010110 DL : 0: 1．用类编写并测试3×3矩阵转置函数，并且使用数组保存转置后的矩阵，要求使用动态内存分配方法。P206，例题6-5，6-17，6-26，27-1. Written and tested with a class of 3 × 3 matrix transpose function, and after using the array containing the transposed matrix, requires the use of dynamic memory allocation. P206, examples 6-5,6-17,6-26,27
Date : 2026-01-19 Size : 1.83mb User : 小蔡
[Data structs] BigInt DL : 0: 超大整数类，支持加减乘除取余等功能，用数组实现-Large integer class to support Math modulo functions, with the array to achieve
Date : 2026-01-19 Size : 2kb User : TFN
[Data structs] class-array DL : 0: a program that perfect for beginners of learning array in c++!
Date : 2026-01-19 Size : 105kb User : spidey
[Data structs] dynamic-array-distribution DL : 0: 在c++中利用类模板建立动态数组，实现数组的排序，插入，删除-In c++,use a dynamic array class template, realize the array sort, insert, and delete
Date : 2026-01-19 Size : 4kb User : zhusujie
[Data structs] One-dimensional-dynamic-array-class DL : 0: 一维动态数组类：定义和一维动态数组，包括重载数组运算符-One-dimensional dynamic array class: definition and one-dimensional dynamic array, including overloaded array operator
Date : 2026-01-19 Size : 1kb User : zzs
[Data structs] dir-biao DL : 0: 这是一个C++设计的动态数组顺序表类，帮助别人学习C-This is a dynamic array class C++ order table designed to help others learn C++
Date : 2026-01-19 Size : 2kb User : 姜雪峰
[Data structs] Matrix DL : 0: 自定义数组类，实现生成任意规模的数独文本文件。-A custom array class implementation of arbitrary size sudoku.
Date : 2026-01-19 Size : 4.62mb User : niuwe

« 12 »