Write a method splitstack that takes a stack of integers as a parameter and splits it into negatives and non-negatives. the numbers in the stack should be rearranged so that all the negatives appear on the bottom of the stack and all the non-negatives appear on the top. in other words, if after this method is called you were to pop numbers off the stack, you would first get all the nonnegative numbers and then get all the negative numbers. it does not matter what order the numbers appear in as long as all the negatives appear lower in the stack than all the non-negatives. you may use a single queue as auxiliary storage.

answer: 5

explanation:

6-1

answer:

the correct answer is d

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)