Open AccessLINEAR SEARCH ALGORITHM TO BE SOLVED BY PARAMETER LOOP
Author(s) -
Jantsansambuu DASHDEMBEREL,
D. Buren-Arvijikh
Publication year - 2020
Language(s) - English
Resource type - Conference proceedings
DOI - 10.31435/rsglobal_conf/30122020/7350
Subject(s) - computer science , set (abstract data type) , informatics , process (computing) , core (optical fiber) , element (criminal law) , theoretical computer science , algorithm , programming language , telecommunications , law , political science , electrical engineering , engineering
There are common occasions for finding out required optional data or element from the given algebra of sets and any kind of systems when we are solving practical and informatics tasks. In order to solve these types of tasks or issues, students or researchers have to know about the methodologies for basic understanding which are called tasks for searching. This process is very important as for finding out basic understanding and methodologies, having detailed knowledge of algorithms and searching methods, although there are modern specific technologies and automatic programming systems. When searching methods are programmedfor informatics tasks, necessary abilities such as seeking essential or import of program language operators and making analysis indifference among characterful solving should be owned by students or specialists. Therefore,I set my purpose of thesis of organizing linear searching algorithms by the parameter loop of the programming language C during the discovering process of identifying differences, patterns, and internal core of linear searching methodologies.