Intro

Hello. I am a software engineer. I live in Tokyo, Japan. I have started this blog for the following reasons:
- show my skills
- note to self
- practice writing English

Thank you.

Comments

Post a Comment

Popular posts from this blog

Introduction to Algorithms No.1

I have decided to read " Introduction to Algorithms ." This is one of the most famous textbook on algorithms. I will write what I think when I read it. Today, I will write an article on Chapter 1 Chapter 1 refers to "The Role of Algorithms in Computing." The points are as follows: - An algorithm receives an input and returns an output. - Algorithms play an important role in information technology. - A good algorithm on a bad computer may exceed a bad algorithm on a good computer. Good algorithms are as important as a good computer! Thank you.
Read more

Introduction to Algorithms No.7

Hello. Today, I have started Chapter 4, "Divide and Conquer." And I have learnt "The maximum-subarray problem." Maximum-subarray algorithm can solve that problem. Suppose you have time series of stock prices, such as (5 10 4 2 3 7 1 5 6 2). You are at time 1 now. The stock price is 5 now. You know the future stock price (5 10 4 2 3 8 1 3 6 2). Then when will you buy the stock and sell it? The answer is, you should buy it at time 4 and sell it at time 6. Then you get 6. I have written two codes, which run with different running time. One algorithm runs with Theta(n^2). The other runs with Theta(n*log(n)). Therefore, the latter runs faster. The two algorithms are as follows: https://github.com/uriha421/introduction_to_algorithms/blob/master/I_Foundations/maximum-subarray_problem_slow.c https://github.com/uriha421/introduction_to_algorithms/blob/master/I_Foundations/maximum-subarray_problem_fast.c You will be surprised to recognize that the slow program is mu...
Read more

Introduction to Algorithms No.4

Hello. I have learnt and written the selection sort: https://github.com/uriha421/introduction_to_algorithms/blob/master/I_Foundations/selection_sort.c I have also learnt the running time of an algorithm. The running time means how long it takes to execute an algorithm. It is clear that it depends on the size of an input. It also depends on the input itself. Let's take an example of the insertion-sort algorithm. If the input array is already sorted, the running time is clearly shorter than the average running time. On the other hand, the input is reversely sorted, the running time is much longer. And it is more important to think about the running time in the worst case. Because ... I have to go to bed :( See you tomorrow.
Read more