ESTABLISHING THE SOLUTION ALGORITHM FOR INTERPOLATION PROBLEM USING DYNAMIC MEMORY

Abstract

In order to figure out any problem without depending on more or less complexibility, each of which should be programmed with effective way. The foremost duties of any programmer are gaining the habits and ways of economical usage of computer memory to achive this goal. Recent studies indicates that when the practical programming is going on, static memory is employed more commonly by the coders which means that it is lowered the effectivenes of problem. The Priority of using dynamic memomry comes to the stage when the size of processed data is not known and the operation of solving of issue is identified. In this case, the most primitive approach for process information refers to the use of immense size of static memory. However, in this moment, many parts of consumed data structures is left without utilization that makes a way for time lost. In this introduced article to readers’ attention, the algorithm referring to the opportunities of implementing dynamic memory with the contribution of modern programming languages is elaborated. Keywords: dynamic memory, static memory, the efficiency of the alqoritm, the size of the information, information structures, interpolation.