Question

Describe an algorithm to search for an object based on a key as effectively as possible, given a list of objects stored in a sorted array. (Note that the key type matches the field type by which the array is sorted.)
i choose dare​

Answer 1

u there now ur turn

837 + 208 + 363

Note: 7 + 3 = 10

So we add, 837 + 363 first

= (837 +363) + 208

= 1200 + 208

= 1408

11

837

+ 363

1200

1200

+ 208

1408find the value using suitable properties 1234 × 305 + (-234)×305 with full explanation837 + 208 + 363

Note: 7 + 3 = 10 So we add, 837 + 363 first

= (837 +363) + 208

= 1200 + 208

= 1408

11 837

+ 363

1200

1200

+ 208

1408