#99

Author: forfudan

README.md

@@ -39,7 +39,13 @@ DeciMojo is available in the [modular-community](https://repo.prefix.dev/modular
 
 From the `pixi` CLI, simply run ```pixi add decimojo```. This fetches the latest version and makes it immediately available for import.
 
-For projects with a `mojoproject.toml`file, add the dependency ```decimojo = "==0.4.1"```. Then run `pixi install` to download and install the package.
+For projects with a `mojoproject.toml`file, add the dependency:
+
+```toml
+decimojo = "==0.5.0"
+```
+
+Then run `pixi install` to download and install the package.
 
 For the latest development version, clone the [GitHub repository](https://github.com/forfudan/decimojo) and build the package locally.
 
@@ -50,6 +56,7 @@ For the latest development version, clone the [GitHub repository](https://github
 | v0.3.0     | ==25.2        | magic           |
 | v0.3.1     | >=25.2, <25.4 | pixi            |
 | v0.4.x     | ==25.4        | pixi            |
+| v0.5.0     | ==25.4        | pixi            |
 
 ## Quick start
 
@@ -296,7 +303,7 @@ If you find DeciMojo useful for your research, consider listing it in your citat
     year         = {2025},
     title        = {An arbitrary-precision decimal and integer mathematics library for Mojo},
     url          = {https://github.com/forfudan/decimojo},
-    version      = {0.4.1},
+    version      = {0.5.0},
     note         = {Computer Software}
 }
 ```

docs/changelog.md

@@ -14,6 +14,7 @@ This is a list of RELEASED changes for the DeciMojo Package.
 1. Refine the `BigUInt` multiplication with the Karatsuba algorithm. The time complexity of maltiplication is reduced from $O(n^2)$ to $O(n^{ln(3/2)})$ for large integers, which significantly improves performance for big numbers. Doubling the size of the numbers will only increase the time taken by a factor of about 3, instead of 4 as in the previous implementation (#97).
 1. The `__isub__` method of `BigUInt` will now conduct in-place subtraction. `x -= y` will not lead to memory allocation, but will modify the original `BigUInt` object `x` directly (#98).
 1. Refine the arithmetic operations of `BigUInt` when the second operand is one-word long or is a `UInt32` value (#98).
+1. Refine the division of `BigUInt` to improve performance (#98, #100).
 1. Add `to_uint64()` and `to_uint128()` methods to `BigUInt` to for fast type conversion (#91).
 1. Improve error messages and remove unnecessary `raises` keywords for all functions (#92).