# How to find a suitable index for a value in an array min binary heap?

**URL:** <https://forum.codewithmosh.com/t/how-to-find-a-suitable-index-for-a-value-in-an-array-min-binary-heap/19616>\
**Category:** Uncategorized\
**Created:** [April 16, 2023, 4:07pm UTC](https://forum.codewithmosh.com/t/how-to-find-a-suitable-index-for-a-value-in-an-array-min-binary-heap/19616 "2023-04-16T16:07:27Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![xjob](https://avatars.discourse-cdn.com/v4/letter/x/8dc957/32.png) [@xjob](https://forum.codewithmosh.com/u/xjob)\
**Post date:** [April 16, 2023, 4:07pm UTC](https://forum.codewithmosh.com/t/how-to-find-a-suitable-index-for-a-value-in-an-array-min-binary-heap/19616/1 "2023-04-16T16:07:27Z")

</div>

How do I find a suitable index for a value X in an array implemented min binary heap in o(log log n) time? (no actual insertion is required)
