Skip to main content

Questions tagged [java]

Java (not to be confused with JavaScript) is a class-based, object-oriented, strongly typed, reflective language and run-time environment (JRE). Java programs are compiled to bytecode and run in a virtual machine (JVM) enabling a "write once, run anywhere" (WORA) methodology.

Filter by
Sorted by
Tagged with
4 votes
2 answers
405 views

From the previous post, I have incorporated the nice answers made by Chris and Chip01. Code ...
coderodde's user avatar
  • 32.3k
4 votes
2 answers
465 views

Intro (The previous version is here.) (The next version is here.) Now I have incorporated nice answers made by Chris and Chip01. What changed: Fixed the computation of median, ...
coderodde's user avatar
  • 32.3k
4 votes
3 answers
452 views

Intro (See the next iteration A tiny Java framework for gathering running time statistics - Take II.) I have this tiny Java framework that allows users to gather running time statistics of a piece of ...
coderodde's user avatar
  • 32.3k
1 vote
1 answer
110 views

Intro (See the version 1.0.0.) (See the GitHub repository.) This time I have got rid of some generic classes and adapted the entire code base to deal with byte ...
coderodde's user avatar
  • 32.3k
5 votes
1 answer
471 views

Intro (See the version A Java program for compressing/decompressing files via Huffman algorithms (version 1.1.1).) (The full repository is here. It contains also some unit tests that do not fit in ...
coderodde's user avatar
  • 32.3k
2 votes
1 answer
160 views

Intro (This is the continuation of HuffmannEncoder.java - computing prefix codes for arbitrary (generic) alphabets.) (See the GitHub repository.) This time: I have fixed the misspelled ...
coderodde's user avatar
  • 32.3k
4 votes
2 answers
369 views

(See the continuation of this post at HuffmanEncoder.java - computing prefix codes for arbitrary (generic) alphabets - Take II.) I have this Java implementation of the Huffmann encoding. It looks like ...
coderodde's user avatar
  • 32.3k
-2 votes
2 answers
214 views

Another second thought from the second thoughts series Object oriented programming deque implementation (after second thought) led to disposing if statements ...
user avatar
3 votes
2 answers
858 views

Intro In this post, I will present three (3) non-negative integer encoding techniques: Elias gamma coding Elias delta coding Golomb-Rice coding Code ...
coderodde's user avatar
  • 32.3k
4 votes
3 answers
493 views

Intro In this post, I will elaborate on A simple method for compressing white space in text (Java). Here, I have incorporated some advice offered by Chris. Also, this version preserves a single new ...
coderodde's user avatar
  • 32.3k
2 votes
2 answers
266 views

Intro A sort is called super linearithmic if its running time is \$\omega(N \log N)\$. For example, \$f(N) = \omega(g(N))\$ means that \$f(N)\$ grows "faster" than \$g(N)\$. In this post, I ...
coderodde's user avatar
  • 32.3k
5 votes
1 answer
541 views

(The story continues in A simple method for compressing white space in text (Java) - Take II.) Intro Now I have that text space compressor. For example, ...
coderodde's user avatar
  • 32.3k
-7 votes
1 answer
136 views

The java.util.Deque implementation from Object oriented programming deque implementation that consists of three elements linked arrays, each array holding reference ...
user avatar
2 votes
1 answer
160 views

Intro This time, I have implemented the Shannon-Fano coding. Code io.github.coderodde.compression.ShannonFanoEncoder.java ...
coderodde's user avatar
  • 32.3k
1 vote
1 answer
114 views

(Refer to the entire repository in GitHub.) How it looks like Intro This time, I present my take on Jump point search that I translated from Javascript (PathFinding.js/src/finders/JumpPointFinderBase....
coderodde's user avatar
  • 32.3k

15 30 50 per page
1
2 3 4 5
728