Lynda.com is a very good source to start with. Totally recommend you to check it out
Answer:
Following are the algorithm to this question:
y = 0 // initialize variable y that assigns the value 0
p = 1 // initialize value 1 in the variable p which also known as starting position
init num = 1//define variable num that assign value 1
for j = 1 to n: //defining loop
y = m[j] - m[p]
if (y > 10) //defining if block
num++; //increment num variable
p=i; //holding loop value in p variable
y= 0//assign value 0 in y variable
Explanation:
Following are the runtime analysis of the above-given algorithm:
The above-provided algorithm is greedy, but if it doesn't exceed the scope, it operates by greedily choosing its next object. Therefore the algorithm selects the fewest number of pens.
Running time:
This algorithm merely iterates once over all the points. The run-time is therefore O(n).
I think it is better to ask questions and troduce yourself
Answer:
You copy and paste it
Explanation:
right click on the mouse then it will say copy, you right click on the mouse and click paste voila! it works! (If you're using word there are 3 options for pasting, Keep source formatting, Merge formatting and keep text only)
#1, Option D)filters let you filter out certain things or search for them. For example if i'm looking through a database with all the students grades. I could filter out everything that doesnt math a students name. This would only show results for what I searched for.
#2 Option C), filters make it easier to find specific information,
#3 Option A),the unwanted parts of the web are removed from sight!
#4 Option A) you must ad the sort feature first!
Have a splendid day!
