Description: line.c-a software company about 30 employees, each employee has the name, work number, and rank each year, staff turnover and vacancies. All employees in accordance with the order of a linear table storage structure, the establishment of separation and entry functions, when employees leave or entry, modify the linear form, and print the latest staff list. Compute.cpp-- Joseph (Josephus) Central problems 8Queens.cpp--8 queens 4Colors.cpp--4 color problem 4Fib.cpp--f0 = f1 = f2 = 0, f3 = 1, ..., fi = fi- 1+ fi-2+ fi-3+ fi-4, with size k = 4 of the cycle for the queue, before the construction sequence n+1 items (f0, f1, f2, ... fn), required to meet the fn ≤ 200 and fn+1> 200.
To Search:
File list (Check if you may need any files):
4Colors.cpp
4Fib.cpp
8Queens.cpp
Compute.cpp
line.c