Answer:
A linear search is one that scans every record/file until it discovers the value being searched for.
Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.
The linear search will return the lowest value faster than the binary search when small arrays are involved.
This will only be feasible when the array is sorted prior.
Cheers!
I'm pretty sure the answer is code
Following are the code in java to reverse any string without using reverse function.
import java.util.*; // import package
class Main // class
{
public static void main(String args[]) // main class in java
{
String s, r = ""; // string variable
Scanner out = new Scanner(System.in); // scanner classes to take input
System.out.println("Enter a string to reverse");
s = out.nextLine(); // input string
int l1 = s.length(); // finding length of string
l1=l1-1;
for ( int i = l1 ; i >= 0 ; i-- ) // for loop to reverse any string
{
r = r + s.charAt(i);
}
System.out.println(" The Reverse String is: "+r); // print reverse string
}
}
Explanation:
firstly we input any string ,finding the length of that string then after that iterating over the loop by using for loop and last display that reverse string
output
Enter a string to reverse
san ran
The Reverse String is: nar nas
B that the anser yep i whent and reserch the the anser so itsb