Visually displays various searching and sorting techniques using different multitasking techniques.
Download source files - 87.3 Kb
Download demo project - 97.6 Kb
The following table summarizes some key features of our data manipulation
techniques:
table1
| Method | Duplicates | Resizing | Sorting |
ADO Detached RecordSet | User defined | (automatic) | Good |
ADO Detached RecordSet (Indexed) | User defined | (automatic) | Good |
ADO.NET DataTable | User defined | (automatic) | Fast |
ADO.NET DataView | User defined | (automatic) | Fast |
Array(X) of Structures | Allowed | No | Good |
Array(X,3) of Objects | Allowed | No | Slow |
| Collection | Not Allowed | (automatic) | Slow |
ArrayList Collection | Allowed | (automatic) | Good |
SortedList Collection | Not Allowed | (automatic) | (automatic) |
HashTable Collection | Not Allowed | (automatic) | (automatic) |
Queue Collection | Allowed | (automatic) | n/a (FIFO only) |
| Method | Searching | Insert | Remove |
ADO Detached RecordSet | Slow | Flexible | Flexible |
ADO Detached RecordSet (Indexed) | Good | Flexible | Flexible |
ADO.NET DataTable | Good | Flexible | Flexible |
ADO.NET DataView | Very Good | Flexible | Flexible |
Array(X) of Structures | Slow | No | No |
Array(X,3) of Objects | Slow | No | No |
| Collection | Very Fast | Flexible | Flexible |
ArrayList Collection | Fast | Flexible | Flexible |
SortedList Collection | Fast | n/a (sorting always forced) | Flexible |
HashTable Collection | Fastest | n/a (sorting always forced) | Flexible |
Queue Collection | Slow | At the end only | From top only |
