With i<span>ndexed sequential access, an index is more useful when the number of record is large. Index is needed to order the elements of the data base by specific index. For example you have client database. You have city index in your data base and you can order your clients by the city where they live.</span>
Answer:
A. 11000000
Explanation:
A. 11000000 is 192
B. 01111111 is 127
C. 00000001 is 1
D. 10111111 is 191
Therefore, making A the largest.
<span>c. return a pointer to the first appearance of c appearing inside s and nullptr (0) if c does not appear inside s.</span>
Answer:
a)None
b)All
this is ur answer from my opinion
