Write and algorithm that finds the smallest element in the sequence s1, s2,….,sn of n distinct numbers. the input is the sequence, s, and the index, n, of the last term of the sequence. the output is the index of the smallest element in the sequence. this is what i have. i know its wrong but i am just trying to understand it. input: s1,s2, : ? algorithm: 1. i=02. out=03. i = i +14. if out > i, out=i5. repeat 3 and 4 until i==n6. display the smallest number

When designing content as part of your content marketing strategy, what does the "think" stage represent in the "see, think, do, care" framework?

The file sales data.xlsx contains monthly sales amounts for 40 sales regions. write a sub that uses a for loop to color the interior of every other row (rows 3, 5, etc.) gray. color only the data area, columns a to m. (check the file colors in excel.xlsm to find a nice color of gray.)

Write a function so that the main0 code below can be replaced by the simpler code that calls function mphandminutes tomiles0. original main0 int main) l double milesperhour-70.0; double minutestraveled = 100.0; double hourstraveled; double milestraveled; hourstraveled = minutestraveled / 60.0; milestraveled = hourstraveled * milesperhour; cout < "miles" 2 using namespace std; 4 /* your solution goes here/ 6 int maino 1 test passed 7 double milesperhour 70.0 all tests passed 8 double minutestraveled 100.0; 10 cout < < "miles: " < < mphandminutestomiles(milesper-hour, minutestraveled) < < endl; 12 return 0; 13