There is no special definition for VB; it is the same as in any other programming language - and the definition is similar to the commonly used definitions (i.e., outside of computer programming). Something like this:
Search: try to find information.
Sort: Reorganize data items in such a way that each data item is larger than the one before it.
vikram
Yes, searching and sorting are fifferent things.
Searching allows you to find data that meets specific criteria. Sorting allows you to organize that data, based upon the rules you choose (most common is alphabetical).
Sorting that is accomplished entirely in memory without using disks or tapes for temporary files.
Keep searching cp trainer 8.Wait a minute, make it! With vb 2008!
Efficient searching and sorting of records in a database can be achieved through the use of indexing, which creates a data structure that improves retrieval speed. Additionally, employing optimized algorithms for sorting and searching, such as binary search for sorted datasets, enhances performance. Proper database normalization also minimizes redundancy, leading to faster queries. Finally, leveraging in-memory databases can further accelerate access times for frequently queried data.
When you're searching for something you are simply examining each entity, comparing them with another entity in order to locate a match. When you're sorting entities, you are re-arranging the order of those entities. In both cases you will perform a comparison between two entities at a time, the only real difference is that you do not re-arrange the entities when searching.
Yes it is try searching the definition
Yes it is possible, most things are in VB
Selection of algorithm depnds on the programmer. So, this is not a question whose answer is same, if given by many people. Searching and Sorting can be done by various ways, this is true but the idea of using the method varies from programmer to programmer
vb or vb
vb or vb