搜索结果

This book brings together indispensable knowledge for building efficient, high-value, Linux-based embedded products: information that has never been assembled in one place before. Drawing on years of experience as an embedded Linux consultant and field application engineer, Christopher Hallinan offe ...

A order algoritm comparison by the C time(). Comparison beetwen : insort,selection sort,mergesort,and quick sort. Read the source, and the usage after compiling . Enjoy it!

High Speed USB Design Guidelines

High performance lexical compression engine - x86 based.

This is a safe double linked list data structure in order to store data on void* pointer for data segment.

This is a binary search tree with void* pointer in data segment in order you to search store and delete O(n) worst case, O(log(n)) agerage case data.

High scool C++ sample code (exercise)

Interactive smoothing for your own data, with sliders to control derivative order, smooth width, and scale expansion.

This project developed in java leads us to realize a flight reservation system in order to emulate databases containing the structures for the flight and for the booking. These bases extend the List interface and implements additional search鈥檚 methods. Two interfaces provide an access to this syst ...

it is verty super and high quality program for the aai