Jump Search Optimization #3

Open

opened

Instead of performing Linear Search after the element is greater than key value. We can use binary search between two indices which makes the Time Complexity by sqrt(log(n))

Metadata

Assignees

No one assigned

Labels

No labels

No labels

Type

No type

Fields

No fields configured for issues without a type.

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests