Hi,
the program is as follows
___________________________________________________________
import java.io.*;
class doubleval
{
public static void main()throws IOException
{
DataInputStream dt=new DataInputStream(System.in);
System.out.println("Enter NUMBER WHOSE DOUBLE U WANT TO PRINT");
int n=Integer.parseInt(dt.readLine());
for(int i=n;i<=100;i=2*i)
{
System.out.println(i);
}
}
}
Answer:
Answered below
Explanation:
//Program is written in Python programming language
def charCnt( fileName, char){
if not fileName.exists( ):
return sys.exit(1)
else:
openFile = open("$fileName.txt", "r")
readFile = openFile.read( )
fileLength = len (readFile)
count = 0
for character in range(fileLength):
if readFile[character] == char:
count++
openFile.close( )
return count
}
Answer:
The worst case running time of a linear search is O(N).
Explanation:
In a linear search, you will run the program looking at each array position until you find your desired information.
The best case scenario is when you find it at the first position.
The worst case scenario is when you find the value at the last array position. So, in a N-length array, the information is at position N. This means that the worst case running time of a linear search is O(N).
