すべてのカテゴリ

String manipulation algorithmThe data you can use on your computer includes not only numericaldata but also character data. There are various types of characterssuch as alphabets, symbols, hiragana, katakana, and kanji.A collection of multiple characters is called a character string.For example, it becomes the string "PROGRAM" by collectingthe 7 letters "P", "R", "O", "G", "R", "A", and "M". Therefore,you can think of a string as a "table (array) that contains onecharacter for each element."In the Fundamental Information Technology Engineer Examination,there may be questions of exam such as counting the frequencyof appearance of characters and checking whether the specifiedcharacter string i

SortIt is called sorting that you sort multiple data in a certain order. This is usedwhen you want to sort in ascending or descending order.Below are some of the sorting algorithms.（１）Insertion sortThis is a method of sorting by repeating the procedure of inserting elementsthat have not been assigned yet in the correct position.（２）Quick sortDecide a reference value, divide it into large and small groups, and repeat thisto align.（３）Selection sortThis is a method of sorting by repeating the procedure of finding themaximum value (or minimum value) in the table.（４）Bubble sortCompare the values of adjacent elements and exchange if the magnitude isreversed. This is a way to repeat this comparison

Search algorithm　In the Fundamental Information Technology Engineer Examination, thefollowing algorithms tend to be asked.・Search (linear search, binary search, hashing method, etc.)・Sort (quick sort, insertion sort, etc.)・String manipulation (string search, string compression)This time, I will explain about "Search".Searching is the process of finding specific data in a collection of data, suchas an array or file. Here are two typical search methods.（１）Linear searchThis is a method of searching from the beginning (or end) of the array in orderto search for specific data.If the data is found, the search is completed. If you search to the end of thearray and do not find it, then there is no d