Answer:
i) The time taken for 1500 records = 15 seconds.
ii) The time taken for 1500 records = 50 seconds.
Explanation:
A is an O(n) algorithm.
An algorithm with O(n) efficiency is described as a linearly increasing algorithm, this mean that the rate at which the input increases is linear to the time needed to compute that algorithm with n inputs.
From the question, it is given that for 1000 records, the time required is: 10 seconds.
Algorithm time taken is O(n)
Hence,
1) For 1,500 records
=> 10/1000 = x/1500
=> 10x1500/1000 = x
x = 15 seconds
Thus, the time taken for 1500 records = 15 seconds.
2) For 5,000 records
=> 10/1000 = x/5000
=> 10x5000/1000 = x
x = 50 seconds
Thus, the time taken for 1500 records = 50 seconds.
Compatibility mode is so older or different versions of word all look the same regardless of its current version. So a lot of features you see in compatibility mode will be unavailable unless you upgrade. If you upgrade though be sure to uninstall the older version first. I hope this helped!!! Good Luck! :)
Answer: my best friend does her instgram is
user9294586
guess its d drivers , since u said wen it gets outdated
Answer:
backup() {
read dirname;
if [[ whereis . /`$dirname` 2> sterr.exe]]
then
mkdir $dirname
for f in . / *.cpp
do
cp f "path_to_dirname"
echo "file backup complete"
}
backup( )
Explanation:
The bash script above is used to backup C++ source files in a directory to a backup directory which is created if it does not exist, and copy's each .cpp file to backup, then sends a message to declare its completion.
