Please help me with these questions. I am having trouble understanding what to do Programming Language: (HTML, CSS, JavaScript) Please provide preconditions and postconditions for each solution you provide. IMPORTANT: In Ex 13, 14, and 15 , you are not allowed to use strings. Instead, you should work with numbers and mathematical operators, such as division, remainder, etc. 13) The following sequence of numbers is used in a sorting algorithm called Shell sort (https://en.wikipedia.org/wiki/Shellsort), which balances implementation complexity and performance. 1, 3, 7, 15, 31 … The n-th number in the sequence is equal to (2n - 1), where n is some positive integer. Devise an algorithm to input an integer greater than 0 as n, and output the first n members of this sequence. Ex 14) Devise an algorithm to input an integer greater than 1 as n, and output the first n values of the Fibonacci sequence. In Fibonacci sequence, the first two values are 0 and 1 and other values are sum of the two values preceding it. For instance, if the input is 4, the program should print 0, 1, 1, 2. As another example, if the input is 9, the program should output 0, 1, 1, 2, 3, 5, 8, 13, 21.
Please help me with these questions. I am having trouble understanding what to do
Programming Language: (HTML, CSS, JavaScript)
Please provide preconditions and postconditions for each solution you provide.
IMPORTANT: In Ex 13, 14, and 15 , you are not allowed to use strings. Instead, you should work with numbers and mathematical operators, such as division, remainder, etc.
13) The following sequence of numbers is used in a sorting
Devise an algorithm to input an integer greater than 0 as n, and output the first n members of this sequence. Ex
14) Devise an algorithm to input an integer greater than 1 as n, and output the first n values of the Fibonacci sequence. In Fibonacci sequence, the first two values are 0 and 1 and other values are sum of the two values preceding it. For instance, if the input is 4, the program should print 0, 1, 1, 2. As another example, if the input is 9, the program should output 0, 1, 1, 2, 3, 5, 8, 13, 21.
Ex 15) Devise an algorithm to input a positive integer, n, – and by using ‘*’ characters – output the figure below that has n rows, with 3 ‘*’ characters in the top row and 3*n characters in the last row. For instance, if input is 5, the figure on the left (and if the input is 12, the figure on the right) should be generated by the program.
Step by step
Solved in 4 steps with 2 images
