Answer:
Binary sort
Explanation:
Binary sort is one of the fastest search techniques used on arrays and other iterable data types. It algorithm sorts the array in ascending order then gets the item in the middle from which it divides the array to be searched in two parts. If the searched term is less than the mid item, then it is searched for in the first part, else it would be in the second.
Answer:
settings>Accessibility>Touch>AssistiveTouch>Turn off
Explanation:
Answer:
Following are the program in the C++ Programming Language.
//set header file
#include <iostream>
//set namespace
using namespace std;
//define class
class format
{
//set access modifier
public:
//set string type variable
string res;
//define function
void names(string first_name, string last_name)
{
//set if-else if condition to check following conditions
if(first_name.length()>0 && last_name.length()>0)
{
res="Name: "+last_name+", "+first_name;
}
else if(first_name.length()>0 and last_name.length()==0)
{
res="Name: "+first_name;
}
else if(first_name.length()==0 and last_name.length()==0)
{
res="";
}
}
//define function to print result
void out(){
cout<<res<<endl;
}
};
//define main method
int main() {
//set objects of the class
format ob,ob1,ob2;
//call functions through 1st object
ob.names("John","Morris");
ob.out();
//call functions through 2nd object
ob1.names("Jhon","");
ob1.out();
//call functions through 3rd object
ob2.names("", "");
ob2.out();
}
<u>Output</u>:
Name: Morris, John
Name: Jhon
Explanation:
<u>Following are the description of the program</u>:
- Define class "format" and inside the class we define two void data type function.
- Define void data type function "names()" and pass two string data type arguments in its parameter "first_name" and "last_name" then, set the if-else conditional statement to check that if the variable 'first_name' is greater than 0 and 'last_name' is also greater than 0 then, the string "Name" and the following variables added to the variable "res". Then, set else if to check that if the variable 'first_name' is greater than 0 and 'last_name' is equal to 0 then, the string "Name" and the following variable "first_name" added to the variable "res".
- Define void data type function "out()" to print the results of the variable "res".
- Finally, we define main method to pass values and call that functions.
A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers.
<h3>What is a binary search tree?</h3>
A binary search tree, also known as an ordered binary tree or a sorted binary tree in computer science, is a rooted binary tree data structure where each internal node's key is higher than all the keys in its left subtree and less than all the keys in its right subtree.
A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers. Because each tree node has a maximum of two offspring, it is known as a binary tree. It can be used to search for the presence of a number in O(log(n)) time.
A binary search tree (BST) is a specific type of binary tree in which every node has a comparable key and a connected or associated value.
To learn more about binary search trees refer to:
brainly.com/question/28295292
#SPJ4
