Search and search forms (searching and its forms)

What is search?

In computer science, search is the process of finding a particular feature in a set of things. The elements in these collections may be records in a well-ordered database, data in a simple array, text in a file, nodes in a tree, points and edges in a geometry, or elements of other search spaces.

What's the role of search?

Search is one of the core algorithms of computer science. We all know that modern computers store a lot of data and information, and we need efficient search algorithms to get the information we need quickly. There are some data organization methods that can speed up search. In other words, if we properly order the data, the search will become easy. Sorting is one of the ways that data is stored sequentially. We need to understand the different kinds of search algorithms.

Search Type

Here are some of the types of search algorithms we need to understand:

• Unordered linear search (Unordered Linear search)
• Ordered linear searching (sorted/ordered Linear search)
• Binary searches (binary search)
• Symbol table and hash list (symbol Tables and Hashing)
• String search algorithm (Tries tree, ternary search tree, suffix tree) (Tries, ternary search and Suffix trees)

Search and search forms (searching and its forms)