# fibanocci with one RECURSIVE CALL only

(10 minutes) Write a program called fib.c that calculates the nth fibanocci

number. The equation for the Fibonacci numbers is defined as follows:

Fib(0)=0

1.
Fib(N)=Fib(N−1)+Fib(N−2)

2. Your program should accept N as a command line argument
3. You MUST solve this program RECURSIVELY
4. Unlike the example in class, you may only have ONE RECURSIVE CALL in

1. Hint pointers help make this possible.

5. Here are the first 100 numbers in the Fibonacci sequence
6. Examples

1../fib.out 0
The 0th fibanocci number is 0.

2../fib.out 1
The 1th fibanocci number is 1.

3../fib.out 10
The 10th fibanocci number is 55.

# c语言作业hw5

Homework 5 Files to submit: wcount.c, perimeter.c, tail.c, ReadMe.txt

• All programs must compile without warnings when using the -Wall option
• If you are working in a group ALL members must submit the assignment on SmartSite
• Submit only the files requested◦ Do NOT submit folders or compressed files such as .zip, .rar, .tar, .targz, etc
• All output must match the provided solution in order to receive credit◦ We use a program to test your code so it must match exactly to receive credit
• All input will be valid unless stated otherwise
• The examples provided in the prompts do not represent all possible input you can receive.Please see the Tests folder for each problem for more adequate testing
• You may assume all inputs are valid unless otherwise specified
• All inputs in the examples in the prompt are underlined

# c语言作业hw4

Homework 4
Files to submit: mat_add.c, all files need to compile connectn.out, a Makefile for connectn.out

• All programs must compile without warnings when using the -Wall option
• If you are working in a group ALL members must submit the assignment on SmartSite
• Submit only the files requested◦ Do NOT submit folders or compressed files such as .zip, .rar, .tar, .targz, etc
• All output must match the provided solution in order to receive credit◦ We use a program to test your code so it must match exactly to receive credit
• All input will be valid unless stated otherwise
• The examples provided in the prompts do not represent all possible input you can receive.Please see the Tests folder for each problem for more adequate testing
• You may assume all inputs are valid unless otherwise specified
• All inputs in the examples in the prompt are underlined

# C++ class repositioned items

In many applications, the order of the data items in a list changes over time. Not only are new data items added and existing ones removed, but data items are repositioned within the list. The following operation is needed to move a data item to the beginning of an array. Do not use a vector for this assignment.

Precondition: the array is not empty.

Postcondition: This function removes the data item marked by a cursor from an array and reinserts the data item at the beginning of the array.

cursor is some indicator for the element to be moved.  It may be an index number or a search key.  For example, the function could take in the index number 4 to move the fifth element of the array to the front.  Alternatively, the function could take in the search string “Joe” and if found in the array, that “Joe” element would be moved to the front.  You can select the strategy you prefer for the cursor.

Minimum Requirements:

• Create a class that has an arra

# COMP2355 PA3 solution

Introduction

In this assignment you will perform a parallel breadth-first search (BFS) of the 4×3 Sliding Tile state space. The result of this search will be that the distance of every state in the state space from the initial configuration will be stored in an array. In C++ you can only access items in an array using an integer offset. Thus, we cannot directly map between our Sliding Tile puzzle class and an element in the depth array. Luckily, there is a 1-to-1 mapping between states in the puzzle and integers between 0 and 12!/2. We can perform this mapping using what are called “Ranking” and “Unranking” functions. A ranking function will convert a state into an integer, and an unranking function will convert an integer into the corresponding state. T