No. If you have your eyes fixed on one spot ahead of you - what happens when that spot moves over into the right lane (or something else) and you end up "following" it and there is a car to the right of you. You will end up in a collision.
Answer: the answer is A.
Explanation: hope this helps!
Answer:
A computer file is made up of three elements: characters, fields and records.
Explanation:
Hope this helps! :D
Answer:
The statement which is correct:
c. The algorithm might be insertion sort, but could not be selection sort.
Explanation:
Selection sort:
In data structure, such a sorting technique in which the smallest element from the unsorted array is swapped with the left-most element. So, the first digit is always the smallest.
Insertion Sort:
In data structure, such a sorting technique in which each element is compared with all other elements of the array.
- As our selection sort picks the largest items first so it can't be selection but can be insertion sort as insertion sort the largest item can come on the first position.