Ad
  • Custom User Avatar
  • Custom User Avatar
  • Custom User Avatar

    Hi @MP7373.

    If you really think the bird-mountain algorithm pictures are ambiguous or can lead to wrong results when correctly followed, then please (in very careful detail) explain how so and I will try to fix the Kata description.

  • Custom User Avatar

    @MP7373 I'm guessing your 2nd paragraph was not aimed toward me?

    Regarding your example, there is still some information missing -- where is the river? Again, an actual test case would help the author (and anyone else) get a clearer understanding of the issue. You can wrap it in a code block, as shown below. Is this the example that you're talking about?

    '  ^  '
    '  ^  '
    '^^^^^'
    '  ^  '
    '  ^  '
    
  • Custom User Avatar

    Nothing arrogant there (except maybe your answer? ;o No, ok. Let's just say you overreacted a bit? ;) ).

    What doc is actually asking for is actual data rather than an explaination: it can be quite hard to understand each others on this kind of problem, so, again, could you provide an actual input to build that test (so that everyone can actually check based on the very same sample data, to avoid any misinterpretation)?

    cheers ;)

  • Custom User Avatar

    @MP7373, it'd probably help a lot more if you were to provide an example to illustrate your point.

  • Custom User Avatar

    I think the colours of the bird-mountain example clearly show how the bird is calculating the height by counting 1,2,3 from the outside to the inside.

    Please correct me if I am wrong, but it sounds like you have invented your own interpretation of that algorithm (different from the bird) and then saying that it does not work.

    So where is the problem? It sounds self-inflicted.

  • Custom User Avatar

    I concur, but this is how it was approved; I think somebody else might raise it, if you find enough support.

  • Custom User Avatar

    Kata description is updated

  • Custom User Avatar

    but the win condition is 4 marks... :o

  • Custom User Avatar
    • Oooh My bad, I've assumed it's Selection Sort, not quick Select , I Apologize :pensive:

    Quick select is the only algorithm I've heard of that has average linear time complexity for getting the nth largest element.

    • Yep, You're Right Martin , Related to the Quick Sort but searching in only one half :+1:... Thanks for your Reply .. regards
  • Custom User Avatar

    @MP7373

    I wrote a quick-select

    • mmm , Interesting Martin , Could be good when dealing with a small array/vector's size But man When dealing with larger ones or testing Code Optimization or Performance no doubt it will let you down :grin:
    • Hope you've enjoyed this humble kata , Array Leaders as Well :wink: , Wish you all the best Martin ,and thanks for your feedback .. Regards .. Zizou
  • Custom User Avatar
  • Custom User Avatar

    Looks like the stats are not calculated yet because you just signed up and showing 0 as a fallback value. It should show the correct value after the next scheduled refresh, but I'll try triggering the job for you.

  • Custom User Avatar

    Who said it's golf in the first place?

    More importantly, why are you assuming things about my code? It's not your code. Do you realize that going around dictating the style of other's code is very rude?

  • Loading more items...