Keep the Order
www.codewars.com
Task: Your job here is to write a function (keepOrder in JS/CoffeeScript, keep_order in Ruby/Crystal/Python, keeporder in Julia), which takes a sorted array ary and a value val, and returns the l...

I just tried my first problem on Codewars and realised: This solution feels like cheating

    • floorjam@lemmy.worldOP
      3·
      11 months ago

      I first did something with findfirst, which needed some bounds checks. Then I saw another answer and they used searchsortedfirst which is just it … Even the documentation reads like the problem description

        • MatFi@lemmy.thias.xyz
          2·
          11 months ago

          Naahh… searchsortedfirst is simply faster than other search algorithms (in this specific case). Extremely useful in many applications.It ist there because Julia cares about efficiency

          • floorjam@lemmy.worldOP
            1·
            11 months ago

            This helped me realize how much this aligns with my problems (and I guess the spirit of this test problem). Sometimes you have special knowledge of your data and can use much more efficient functions that are just there in Julia.