Open address Hash (square detection method) implementation file C Language

/* Open_addressing_hash (2) -- open the fixed address hash implementation file */ # include # include # include "open_addressing_hash (2 ). H " /* local function declaration */ static int get_prime_value (const int size ); static int

Dijkstra improved algorithm C Language

/* 9-10 (B)-12-13-000026.c -- Chapter 9, question 10 (B) */ # include # include # include "binary_heap.h" int main (void); int new_dijkstra (const adjacenty_list * padj, const hash_table * const PHT, const int start); int main (void) {

Binary Search Tree preordered clue + preordered traversal C Language

Void preorderthreading (TREE * const ptree); static void preorder_threading (TREE * const ptree, node ** const previous); void preorderthreadedtraversal (const TREE tree, void (* pfun) (const item); void preorderthreading (TREE * const ptree) {

Open address Hash (linear probing) implementation file C Language

/* Open_addressing_hash.c -- open the fixed address hash implementation file */ # include # include # include "open_addressing_hash.h" /* local data type definition */ struct Apple/* I can't think of any other name */ { int full; int value; };

Insert sort C Language

finally, I started to get started with sorting. The implementation is understandable. It is difficult for me to analyze the complexity. /* 7-1-11-19-0020.1.c -- Chapter 7 First Question */ # include # include # define size 9 typedef int item;

Search for the K-small element C Language

/* 7-23-11-23-23.10.c -- Chapter 7, question 1 */ # include # include # define cutoff (3) # define size (40) # define wrong (-36768) int main (void); void print_array (const int * const array, const int size ); void swap (int * const P1,

Extension tree implementation file C language (aplaytree. c)

The fourth day of the learning tree, the first class stretched the tree. I wrote it for 8 hours. It was so sleepy. It felt so good. After writing it, I read it again and wrote it down. I hope someone else will be willing to communicate with me. /*

Separated link hash implementation file C Language

/* Separate_chaining_hash -- detach the link hash to implement the file */ # include # include # include "separate_chaining_hash.h" /* local data type definition */ typedef struct pair { listnode * parent; listnode * Current; } pair; /*

C ++ for sequential containers

For the use of ordered containers, it is not that simple to write the things that can be taken out and worth taking out. I just registered for the soft exam, and the software designer is about to start again. A small trip, a beautiful world, is

D-heap implementation file C Language

/* D-heap.c -- d-heap implementation file */ # include # include # include "d-heap.h" /* local function declaration */ static int percolate_up (const heap * const pheap, const item, const int position); static int percolate_down (const heap *

Left-side heap (incomplete operation) Implementation of file C Language

/* Lefttist_heap.c -- left-side heap implementation file */ # include # include # include "lefttist_heap.h" /* local ADT definition */ typedef node item2; typedef struct node2 { item2 item2; struct node2 * Next; } node2; typedef struct

Box tree implementation file C Language

/* Box. C -- box problem implementation file */ # ifndef generic # include "box. H " # endif /* local function declaration */ static box * make_box (const weight capacity ); static box * find_max (Box * box); static box * find_min (Box * box );

Linear time sorting (1) C Language

A question. I started thinking about it yesterday, and today I think about it again. I admit that my head is confused, but it is a little slow and I cannot accept it. "Do not rush to continue, do not even thousands of miles; do not accumulate small

C language for quick sorting

I felt like I had to sort these items. At least, I didn't have them in my head. Well, I'm always not focused. Come on. Let's talk about quick sorting. The principle is to constantly divide an array into three parts, so that all arrays are in this

Test the stability of several common sorting algorithms. C Language

The stability of sorting refers to whether the positional order of the same element changes before and after sorting. stable sorting without changing the positional order. unstable sorting is a change in the sequential location relationship. Of

C language for counting and sorting

Sort by count. Watch Wikipedia on the phone during the day. Dealing with int-type data with a small data span is indeed very fast. The code is very intuitive. /* Count_sort-11-03-21-19.01.c -- count sort */ # include # include # define size (10

Determines the number of data in the specified data range. C Language

Read and talk about the exercise behind counting sorting. Indeed, after the testicles, there is a slight pain in your ears. The specified data, in min ~ Within the max range, make sure that the data is in start ~ The number of end data. because it

Implementing the C language of the file using the binary heap of Dijkstra Algorithm

/* Binary_heap.c -- binary heap implementation file */ # include # include # include "binary_heap.h" /* local function declaration */ static int percolate_up (const binary_heap * const PBH, const int index); static int percolate_down (const

Simulation board layout implementation file C ++

Implementation file. The details in the file are related to the output method. You can select multiple output methods without much packaging. // Block. CPP-simulated integrated circuit board implementation file # include "stdafx. H " # include"

C language for Toll Road Reconstruction

Back-to-algorithm. This is also written after various hardships. After writing it, I don't want to say anything more. /* 10-40-11-02-16-06.10.c -- Chapter 10, question 1 *//* 02-18-40th. it took about 13 hours. */ # include # include # define

Total Pages: 5902 1 .... 4262 4263 4264 4265 4266 .... 5902 Go to: GO

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.