Searching and sorting are the two most frequent operations performed on arrays.Computer scientists have devised several data structures and searching and sorting techniques that facilitate rapid access to data stored in lists.
sorting is the process of arranging elements in the list according to their values,in ascending or descending order.A sorted list is called an ordered list.sorted lists are especially important in list searching because they facilitate rapid search operations.Many sorting techniques are available.The three simple and most important among them are:
Searching is the process of finding the location of the specified elements in a list.The specified elements is often called the search key.If the process of searching finds a match of the search key with a list elements value,the search said to be successful;otherwise,it is unsuccessful.The two most commonly used search techniques are:
sorting is the process of arranging elements in the list according to their values,in ascending or descending order.A sorted list is called an ordered list.sorted lists are especially important in list searching because they facilitate rapid search operations.Many sorting techniques are available.The three simple and most important among them are:
- Bubble sort
- Selection sort
- Insertion sort
Searching is the process of finding the location of the specified elements in a list.The specified elements is often called the search key.If the process of searching finds a match of the search key with a list elements value,the search said to be successful;otherwise,it is unsuccessful.The two most commonly used search techniques are:
- Sequential search
- Binary search
No comments:
Post a Comment