kattis
boyermoore
| kattis | boyermoore | |
|---|---|---|
| 7 | 2 | |
| - | 55 | |
| - | - | |
| - | 0.0 | |
| - | over 1 year ago | |
| Go | ||
| - | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
kattis
-
Photoshop alternative for Linux
My brush example in krita: https://gitlab.com/Rairden/kattis/-/raw/master/docs/primeFactorize.png
-
Which language is good for competitive programming?
No, I like kattis. Here is my repo of the java/go src code.
- Boyer-Moore Algorithm is up to 10 times faster than strings.Index for long search terms.
-
Why would I use X language over Y language?
Here is a decent example of a competitive coding problem solved with java and go. Both about 80 lines (the solution should be like 5-10 lines, but I couldn't get it working).
-
Will switching from Python to Java or Golang speed up the execution of this?
Java vs Go. I recently redid one of these little, easy puzzles here in Go. For some reason it wouldn't pass (wrong answer). So I took my java solution which I knew was correct and ran both for every possible output 10 million lines output. The java version took 2:33 mins, and Go took 18 seconds.
-
What ergonomic language features are you dying to have in Java?
I am making a list of why I prefer Go over Java now (for hobby only).
-
Which languages should I try out next?
Go concurrency seems WAY easier to read/write than C++'s openMP. I have a competitive coding problem I cannot beat the time limit, and it should be parallelizable but I can't figure it out. I know the concurrency code needs to be added before this for loop
boyermoore
-
Boyer-Moore Algorithm is up to 10 times faster than strings.Index for long search terms.
If you want you can check it out at (https://github.com/sarpdag/boyermoore) I made a basic implementation, I hope all works.
-
The Boyer-Moore Fast String Searching Algorithm
I implemented it in Go for fun. I expected Go's standard lib will beat it but it perform around 10 times faster than `strings.Index`.
https://github.com/sarpdag/boyermoore
Go's strings package depends on the substring size tries different approaches like Rabin Karp algorithm, (https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm)
What are some alternatives?
NullAway - A tool to help eliminate NullPointerExceptions (NPEs) in your Java code with low build-time overhead
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
elephant-bird - Twitter's collection of LZO and Protocol Buffer-related Hadoop, Pig, Hive, and HBase code.
fast_strstr - A fast substitution to the stdlib's strstr() sub-string search function.
smart - String Matching Algorithms Research Tool
rust-memchr - Optimized string search routines for Rust.
fastsearch - Implements a search algorithm I invented decades ago in 64 bit pascal
kattis - My solutions in Rust and Haskell for select coding challenges on open.kattis.com
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore