Answer:
Following are the solution to this question:
Explanation:
This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.
It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.
Please find the attachment file of the sorting.
Answer:
<h2>NO</h2>
Explanation:
<h2>because Technology does not always follow science but it may actually lead science in some instances. An example is weather forecasting.</h2><h2>Mark me brainliest plz</h2>
Answer:
- var projected_fee = 6000;
-
- for(var i = 1; i <= 5; i++){
- projected_fee = projected_fee * 0.02 + projected_fee;
- console.log("$" + projected_fee.toFixed(2));
- }
Explanation:
Firstly, create a variable, projected_fee, and set the initial tuition fee value to it (Line 1).
Next, user a for loop that run for 5 times to repeatedly calculate the projected_fee based on 2 percent of increment rate (Line 4) and display the projected fee to console terminal (Line 5). The output should be
$6120.00
$6242.40
$6367.25
$6494.59
$6624.48
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find 
, we need to compute 
and 
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and 
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.
