semvec/pypi-packages huggingface dataset:
b8 0.2.3
b8, Bominade Ultralight NeoVim-based IDE
Requires Python: >=3.5

# bominade (b8)

**Vim-based IDE**

Bominade is the successor to a8 and PIDA. It is an extremely light-weight IDE
based on NeoVim, a file browser and a terminal emulator. It is currently in
heavy development but I use it every day.

For all information, check out the website at [bominade.dev](https://bominade.dev)

## Obligatory screenshot

This is what we mean...

![Bominade screenshot](https://gitlab.com/afshar-oss/b8/-/raw/dev/dev/screenshot.png)


## License

MIT License

Copyright (c) 2020 Ali Afshar Open Source Software

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
RMedian-Algorithm 0.0.1
Package for the RMedian algorithm
Requires Python: >=3.6

# RMedian-Algorithm

![GitHub status](https://img.shields.io/badge/status-release-success) ![GitHub top language](https://img.shields.io/github/languages/top/jfklorenz/python-RMedian) ![Travis](https://travis-ci.org/jfklorenz/RMedian-Algorithm.svg?branch=master) ![GitHub](https://img.shields.io/github/license/jfklorenz/python-RMedian)

A **Python** implementation of the **RMedian algorithm**.

The algorithm is presented in the paper **Fragile Complexity of Comparison-Based Algorithms** by Prof. Dr. Ulrich Meyer and others in 2019, which can can be found on [arXiv.org](https://arxiv.org/abs/1901.02857 "arXiv.org").

It introduces the algorithm *RMedian* and also the concept of *fragile complexity*, i.e. the amount of times an element has been compared during the process of the algorithm.

The package was published on **PyPI** and tested on **Travis CI**.

---

Folder | Content
--- | ---
data | all experimental data as *.csv* files
docs | scientific paper presenting the algorithm (old & new version)  |  
jupyter | *Jupyter Notebook* validation and test files
poster | design for a poster explaining the algorithm  |  
src | *Python* source code
tests | *PyTest* test files

---

## Algorithm


---

## Complexity
1. *Runtime:* RMedian requires linear work w(n) = O(n).
2. Let k(n) = n_ε for 0 < ε ≤ 1/2. Then RMedian requires E(f_min(n)) = O(ε−1loglog(n)) comparisons for the minimum and E(f_rem(n)) = O(n_ε) for the remaining elements.
3. Let k(n) = logn/loglogn. Then RMedian requires E(f_min(n)) = O(log(n)/loglog(n)) comparisons for the minimum and E(f_rem(n)) = O(log(n)/loglog(n)) for the remaining elements.