• Projects -
  • Rating -
  • Rating 45

Budget: 100 USD Deadline: 2 days

Hello! I have experience with C++ and optimizing algorithms for working with large arrays. I will implement an efficient sorting script for an array of 0/1 with the ability for complete recovery through a unique rank. I have experience with combinatorics and rank/unrank functions. I am ready to start immediately.

  • Projects -
  • Rating -
  • Rating 58

Budget: 99 USD Deadline: 1 day

I focus on the result, working with respect for the task and details.

  • Projects -
  • Rating -
  • Rating 188

Budget: 100 USD Deadline: 3 days

Good day, there is already a ready example of such code in C++, we can edit everything according to your wishes.

  • Projects -
  • Rating -
  • Rating 144

Budget: 100 USD Deadline: 1 day

Hello, my name is Javid.
I will implement quicksort for a bit array while preserving order through ranking combinations — seed ≤ 60 characters, without a position list.
I will do rank/unrank with GMP or __int128, optimizing with SIMD/OpenMP.
Rate $30/hour

  • Projects 47
  • Rating -
  • Rating 1 261

Budget: 200 USD Deadline: 10 days

Good day. I am ready to complete the task. Please contact me privately for clarification of details.

  • Projects 161
  • Rating 1.0
  • Rating 2 378

Budget: 100 USD Deadline: 1 day

Good day.
Feel free to contact me, I will gladly complete the task quickly and efficiently.

  • Projects 44
  • Rating 4.2
  • Rating 1 955

Budget: 100 USD Deadline: 5 days

I am ready to help you create a function for permuting an array of bits. I guarantee high quality of execution and quick completion of the project.

  • Projects 19
  • Rating 5.0
  • Rating 19 982

Budget: 99 USD Deadline: 2 days

Good day!

Your task is exactly the challenge that I am interested in implementing. I am well-versed in combinatorics, ranking combinations, and working with large numbers, and I understand how to optimize calculations in C/C++.

  • Projects 53
  • Rating 4.9
  • Rating 2 552

Budget: 100 USD Deadline: 2 days

Hello!

I am ready to implement a high-performance algorithm for sorting bit arrays with the capability of 100% recovery by preserving only the rank of the permutation. I have a good understanding of combinatorial principles, particularly working with C(n, k) and binomial coefficients, and I have experience implementing rank/unrank algorithms for combinations.

What I can offer:
• Implementation in C or C++ using GMP or __int128 for working with large numbers (if needed — Boost.Multiprecision).
• Optimization through SIMD, OpenMP, or other acceleration methods for arrays up to 8 MB.
• Providing a compact seed (for example, base62 or base85) from which the original array can be accurately restored, knowing N (the length of the array) and K (the number of 1s).
• Support for the unrank() function to restore the full order.
• Clean, commented code and unit tests.

  • Projects 34
  • Rating -
  • Rating 967

Budget: 100 USD Deadline: 5 days

Good evening, I am ready to implement your task step by step, I will also consider how to create the unrank() function, if the chosen sorting algorithm allows it, then we will do it.

Thank you.

Proposals concealed

The list does not show proposals concealed by the client or freelancer with a Plus profile, as well as proposals violating rules

Current freelance projects in the category C & C++

1:01
16 July
13 July
11 July
5 July