# How to make a C function compiled by myself available to \`ccall\`?

**URL:** <https://discourse.julialang.org/t/how-to-make-a-c-function-compiled-by-myself-available-to-ccall/7972>\
**Category:** General Usage\
**Tags:** ccall\
**Created:** [December 24, 2017, 1:19pm UTC](https://discourse.julialang.org/t/how-to-make-a-c-function-compiled-by-myself-available-to-ccall/7972 "2017-12-24T13:19:15Z")\
**Posts on this page:** 1\
**Showing post:** 29

<div class="post-metadata">

**Author:** ![xiaodai](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/xiaodai/32/15937_2.png) [@xiaodai](https://discourse.julialang.org/u/xiaodai)\
**Post date:** [December 26, 2017, 3:02am UTC](https://discourse.julialang.org/t/how-to-make-a-c-function-compiled-by-myself-available-to-ccall/7972/29 "2017-12-26T03:02:50Z")

</div>

> [@Liso](#):
>
> @btime str\_qsort(svec1)

should the above be `@btime str_qsort($svec1)` instead? As `svec1` gets modified after first run. Also `str_qsort` should be called `str_qsort!`. Also on my computer that sort takes 48 seconds but FastGroupBy’s `radixsort!` only took 19~29 seconds.

```julia
const M=100_000_000; const K=100
using FastGroupBy
srand(1)
svec1 = rand([string(rand(Char.(32:126), rand(1:8))...) for k in 1:M÷K], M)
@time FastGroupBy.radixsort!(svec1) # 29 seconds
issorted(svec1)

```

My [`cradixsort!`](https://discourse.julialang.org/t/wip-faster-string-sort/7671/45) performs poorly atm at 39~50 seconds.

---

_[View the full topic](https://discourse.julialang.org/t/how-to-make-a-c-function-compiled-by-myself-available-to-ccall/7972)._
