Hi, my name is Mingi Hong. I'm first kid in my family grew up in Anyang, Korea. I graduated Art High School majoring theater arts. Performed in Lamama theater in New York Off-Broadway. Now I'm attending Dakota State University majoring Computer Science. Nice to Meet you.

1. Blog
2. WebSite
3. Youtube
4. LinkedIn

Java practices.

Game practices. Implementing it based on Harvard.edu's source

User Interface & User Experience Especially Equipment application UI(My experience)

Developing Algorithm

int[] sortingMedianValues(int desiredCount, int[] originalArr)

To responsive to user desired numbers and array numbers, It should be like above.

I Need Walker

I Need Step

There are Two cases

( Array.Length / DesiredCount >= 2 )

And Else

double walker = (double)(originalArr.Length - 2.0) / (double)((desiredCount - 2.0) * 2.0);
if(originalArr.Length/desiredCount >= 2 )

I still need to think if there is better way, but

This works fine of Speed O(N)

First case is very easy

All we need to do is making logic and exceptions such as Skip and Holding ( Because we have to add last one )

Second case is bit difficult

Because it need other logic to solve

else if((originalArr.Length / (differenceBTWnumbers * 2)) == skipcheck)
{
  skip++;
}