Given a collection of n nuts and a collection of n bolts, arranged in an increasing order of size, give an O(n) time algorithm to check if there is a nut and a bolt that have the same size. The sizes of the nuts and bolts are stored in the sorted arrays NUT S[1..n] and BOLT S[1..n], respectively. Your algorithm can stop as soon as it finds a single match (i. e, you do not need to report all matches).

See explaination

Explanation:

Keep two iterators, i (for nuts array) and j (for bolts array).

while(i < n and j < n) {

if nuts[i] == bolts[j] {

We have a case where sizes match, output/return

}

else if nuts[i] < bolts[j] {

this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1

}

else {

this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1

}

}

Since we go to each index in both the array only once, the algorithm take O(n) time.

there is no universally accepted definition of art. although commonly used to describe something of beauty, or a skill which produces an aesthetic result, there is no clear line in principle between (say) a unique piece of handmade sculpture, and a mass-produced but visually attractive item. we might say that art requires thought - some kind of creative impulse - but this raises more questions: for example, how much thought is required? if someone flings paint at a canvas, hoping by this action to create a work of art, does the result automatically constitute art?