#### Filter Results:

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm optimizes the worst case of the binary search algorithm by comparing the input element with the first & last element of the… (More)

This paper discusses about a sorting algorithm which uses the concept of buckets where each bucket represents a certain number of digits. A two dimensional data structure is used where one dimension represents buckets i.e; number of digits and each bucket's corresponding dimensions represents the input numbers that belong to that bucket. Each bucket is then… (More)

- ‹
- 1
- ›