寻找二进制代码,C代码库,德仔网

代码语言

代码分类

【C】寻找二进制

作者:Dezai.CN / 发布于2011/2/10/ 512

<div>* iterative version */
int search2(char *dict, char *name, int compChars) {
 int low, high, mid, result;
 low = 0;
 high = SIZE_OF_DICTIONARY - 1;
 
 while (low <= high) {
 mid = (low + high) / 2;
 result = strncmp(dict[mid], name, compChars);
 if (result > 0) {
 high = mid - 1;
 } else if (result < 0) {
 low = mid + 1;
 } else {
 return EXIT_SUCCESS;
 } 
 }
 return NOT_FOUND;
}
<div>/* recursive version -- takes more space and, for my money, is more confusing */
int search(char *dict, char *name, int low, int high, int compChars) {
 if (high < low) {
 return NOT_FOUND; 
 }
 int mid = (low + high) / 2;
 int result;
 result = strncmp(dict[mid], name, compChars);
 if (result > 0) {
 return searchName(name, low, mid-1, compChars);
 } else if (result < 0) {
 return searchName(name, mid+1, high, compChars);
 } else {
 return EXIT_SUCCESS; 
 }
 return ERROR_SEARCH;
}
to c Binary Search by rtperson on Nov 12, 2008 Linked Lists in C
// I coded this little piece of overkill for USACO's "Milk2" algorithm training problem. 
// I'm leaving out the actual solution to the problem, but am leaving in the basic 
// manipulations to the linked list itself.</div>
<div>
#include <stdio.h>
#include <stdlib.h></div>
<div>typedef struct timeNode timeNode;
struct Node {
 int begin; /* i.e., the data part */
 int end;
 timeNode *next; /* ptr to the next element */
};</div>
<div>timeNode* addNode(timeNode *last, int begin, int end) {
 timeNode *node;
 node = (timeNode*)malloc(sizeof(timeNode));
 node->begin = begin;
 node->end = end;
 node->next = NULL;
 if (last != NULL) {
 last->next = node;
 }
 return node;
 
}
<div>void insertNode(timeNode *before, int begin, int end) {
 timeNode *add = (timeNode*)malloc(sizeof(timeNode));
 add->begin = begin;
 add->end = end;
 add->next = before->next;
 before->next = add;
}
<div>timeNode* insertBefore(timeNode *before, int begin, int end) {
 timeNode *add = (timeNode*)malloc(sizeof(timeNode));
 add->begin = begin;
 add->end = end;
 add->next = before; 
 return add;
}
<div>
timeNode* deleteNode(timeNode *toDelete) {
 timeNode *retval = toDelete->next;
 free(toDelete);
 return retval;
 
}
<div></div>

评论列表

本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。

试试其它关键字

同语言下

可能有用的

Dezai.CN贡献的其它代码(4037)