Hashing is an approach to searching, which calculates the position of the key in the table based on the value of the key.It is an efficient technique in which key is placed in direct accessible address for rapid search.When the key is known, the position in the table can be accessed directly, without making any […]
Continue ReadingSorting refers to the operation or technique of arranging and rearranging sets of data in some specific order. A collection of records called a list where every record has one or more fields. The fields which contain a unique value for each record is termed as the key field. For example, a phone number directory can […]
Continue ReadingAsymptotic Notations Asymptotic notation is useful describe the running time of the algorithm. Asymptotic notations give time complexity as “fastest possible”, “slowest possible” or “average time”. Asymptotic notation is useful because it allows us to concentrate on the main factor determining a functions growth. Following are commonly used asymptotic notations used in calculating running time […]
Continue Reading