Coding String Method Algorithm in C
Budget: $30 – $250 USD
I am in need of a proficient developer well-versed in the C programming language. The task at hand is to design a unique string method algorithm from start to finish. Key requisites for the potential candidate include:
- Strong know-how of the C language and its application
- Sound knowledge and understanding of string method algorithms
- Aptitude for creating original, efficient, and effective code
Candidates with prior experience in algorithm development will have an edge. The output I am looking for is a C code that implements a string method algorithm correctly and efficiently. You may be required to explain your work as you proceed for clarification and understanding purposes. Efficiency, correctness, and creativity will be key evaluation parameters.
having 3 exercise:
1-The task you've been given involves modifying a simplex algorithm to find the maximum value of a given input, instead of the minimum. Here's a breakdown of the changes you need to make:
2-The program is an implementation of an iterative method to find the roots of a nonlinear equation. It combines three classical methods: the secant method, the bisection method, and the regular false method.
3-The program implements an algorithm to find the minimum point of a one-dimensional nonlinear function. It combines the string method on the derivative function and the improved Quadratic Fit method on the objective function itself.
- Strong know-how of the C language and its application
- Sound knowledge and understanding of string method algorithms
- Aptitude for creating original, efficient, and effective code
Candidates with prior experience in algorithm development will have an edge. The output I am looking for is a C code that implements a string method algorithm correctly and efficiently. You may be required to explain your work as you proceed for clarification and understanding purposes. Efficiency, correctness, and creativity will be key evaluation parameters.
having 3 exercise:
1-The task you've been given involves modifying a simplex algorithm to find the maximum value of a given input, instead of the minimum. Here's a breakdown of the changes you need to make:
2-The program is an implementation of an iterative method to find the roots of a nonlinear equation. It combines three classical methods: the secant method, the bisection method, and the regular false method.
3-The program implements an algorithm to find the minimum point of a one-dimensional nonlinear function. It combines the string method on the derivative function and the improved Quadratic Fit method on the objective function itself.