1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Virty [35]
3 years ago
6

_________ involves encouraging employees to engage in behaviors directly related to goal accomplishment.

Computers and Technology
1 answer:
lianna [129]3 years ago
5 0
Planning involves encouraging employees to engage in behaviors directly related to a goal accomplishment. It is the best way to have excellent performance because it motivates the employees to work harder. Planning involves goal setting, objectives, and determining the course of action to achieve the goal.
You might be interested in
You are asked to simulate a binary search algorithm on an array of random values.An array is the list of similar type of element
Alex Ar [27]

Answer:

Explanation:

Problem statement:

to simulate a binary search algorithm on an array of random values.

Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

Input/output description

Input:

Size of array: 4

Enter array:10  20 30 40

Enter element to be searched:40

The Output will look like this:

Element is present at index 3

Algorithm and Flowchart:

We basically ignore half of the elements just after one comparison.

Compare x with the middle element.

If x matches with middle element, we return the mid index.

Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.

Else (x is smaller) recur for the left half.

The Flowchart can be seen in the first attached image below:

Program listing:

// C++ program to implement recursive Binary Search

#include <bits/stdc++.h>

using namespace std;

// A recursive binary search function. It returns

// location of x in given array arr[l..r] is present,

// otherwise -1

int binarySearch(int arr[], int l, int r, int x)

{

   if (r >= l) {

       int mid = l + (r - l) / 2;

       // If the element is present at the middle

       // itself

       if (arr[mid] == x)

           return mid;

       // If element is smaller than mid, then

       // it can only be present in left subarray

       if (arr[mid] > x)

           return binarySearch(arr, l, mid - 1, x);

       // Else the element can only be present

       // in right subarray

       return binarySearch(arr, mid + 1, r, x);

   }

   // We reach here when element is not

   // present in array

   return -1;

}

int main(void)

{ int n,x;

cout<<"Size of array:\n";

cin >> n;

int arr[n];

cout<<"Enter array:\n";

for (int i = 0; i < n; ++i)

{ cin >> arr[i]; }

cout<<"Enter element to be searched:\n";

cin>>x;

int result = binarySearch(arr, 0, n - 1, x);

   (result == -1) ? cout << "Element is not present in array"

                  : cout << "Element is present at index " << result;

   return 0;

}

The Sample test run of the program can be seen in the second attached image below.

Time(sec) :

0

Memory(MB) :

3.3752604177856

The Output:

Size of array:4

Enter array:10  20 30 40

Enter element to be searched:40

Element is present at index 3

Conclusions:

Time Complexity:

The time complexity of Binary Search can be written as

T(n) = T(n/2) + c  

The above recurrence can be solved either using Recurrence T ree method or Master method. It falls in case II of Master Method and solution of the recurrence is Theta(Logn).

Auxiliary Space: O(1) in case of iterative implementation. In case of recursive implementation, O(Logn) recursion call stack space.

8 0
3 years ago
After you create an array variable, you still need to ____ memory space.
Svetllana [295]
This is a little tricky. I would say reserve. It would help to know what programming language and class this is for because a lot of times when you create an array variable the memory is put onto the stack and you as the programmer do not reserve memory space. Now on the other hand, if you are programming in C and you want to create an array variable and put it on the heap then you would reserve memory space on the heap.
6 0
3 years ago
Which data type can only have the values True or False? A. List B. Slice C. Boolean D. Literal
ki77a [65]
~Hello there! ^_^

Your question: Which data type can only have the values True or False? 

Your answer: Boolean is the data type that can only have the values of True or False.

The answer is option C.

Hope this helps~



8 0
3 years ago
Read 2 more answers
The last programming statement in a Java program is the class statement.
Olegator [25]

Answer:

False

Explanation:

Hope dis helps

6 0
2 years ago
Read 2 more answers
True or False<br>-275+406-325=275+(-325)+406
borishaifa [10]
The answer is false, because -275+406-325 equals -194. And <span>275+(-325)+406 equals 356</span>
7 0
3 years ago
Read 2 more answers
Other questions:
  • In this scenario, two friends are eating dinner at a restaurant. The bill comes in the amount of 47.28 dollars. The friends deci
    7·2 answers
  • Katie created a web site that automatically scales to fit a cell phone. What kind of design did Katie use?
    12·2 answers
  • True or false? malware problems and other compromises of your computer information are rare.
    15·1 answer
  • How do you interpret field in contest of a DBMS?
    5·1 answer
  • Which CSS attribute would change an element's font color to blue
    15·2 answers
  • My mom hid my laptop and now I can't find it​
    9·1 answer
  • After selecting multiple calendars, how do you view them in one single calendar? Open the Backstage view and then the Calendar o
    6·2 answers
  • The Binary Search algorithm works by testing a mid-point, then eliminating half of the list.
    8·1 answer
  • How to call a void method with no parameters IN JAVA?
    8·1 answer
  • In the scenario below, select the evaluation factor that is most important.
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!