Question

[tex]hello\:[tex] can \:[tex]any\:[tex] one\:[tex] give \:[tex]me \:[tex]examples\:[tex] of\: [tex]algorithm\:​

Answer 1

Answer:

Algorithm Examples, #1: Binary Search

Find the midpoint of the sorted array. Compare the midpoint to the value of interest. If the midpoint is larger than the value, perform binary search on right half of the array. If the midpoint is smaller than the value, perform binary search on left half of the array

Answer 2

Answer:

apki dp bohut acchi hai

waise kis class me parte ho