---
title: "Mayesh Mohapatra (@mayeshmohapatra) | Hashnode"
description: "Student Researcher. Read the latest articles by Mayesh Mohapatra on Hashnode."
url: "https://hashnode.com/@mayeshmohapatra"
---

@mayeshmohapatra

# Mayesh Mohapatra

@mayeshmohapatra · Joined November 2020

Student Researcher

## Comments

[Surely, lets continue on discord. I'm available as Mayesh#9842.](https://hashnode.com/posts/fibonacci-search/6059cb4d5771a2129446b9b4/comment/6059ee7525962412b9818ce0#reply-605a8f8147b0d2243d4ab3b6)

Reply · Article · Mar 24, 2021 · [Fibonacci Search](https://hashnode.com/posts/fibonacci-search/6059cb4d5771a2129446b9b4)

[Hello Arjun, Time Complexity is more about how things scale with increasing input size and not about the cost of each iteration. A complexity of O(logn) would simply mean that if the length of the input array is doubled, the effort involved is about 30% more than that of the original input. This stack overflow answer explains it beautifully.](https://hashnode.com/posts/fibonacci-search/6059cb4d5771a2129446b9b4/comment/605a106c25962412b9819114#reply-605a8f5e47b0d2243d4ab3b1)

Reply · Article · Mar 24, 2021 · [Fibonacci Search](https://hashnode.com/posts/fibonacci-search/6059cb4d5771a2129446b9b4)
