backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 11:20:05 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for d7af6fdc8c

Browse Source
This commit is contained in:
github-actions
2020-05-29 23:26:30 +00:00
parent edb3d51ec2
commit 7ad1f171c1
176 changed files with 5342 additions and 4288 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
sorting/library_sort.cpp
View File

@@ -1,15 +1,15 @@
#include <algorithm>
#include <iostream>
void librarySort(int *index, int n) {
void librarySort(int *index, int n)
{
int lib_size, index_pos,
*gaps, // gaps
*library[2]; // libraries
bool target_lib, *numbered;
for (int i = 0; i < 2; i++)
library[i] = new int[n];
for (int i = 0; i < 2; i++) library[i] = new int[n];
gaps = new int[n + 1];
numbered = new bool[n + 1];
@@ -19,7 +19,8 @@ void librarySort(int *index, int n) {
target_lib = 0;
library[target_lib][0] = index[0];
while (index_pos < n) {
while (index_pos < n)
{
// binary search
int insert = std::distance(
library[target_lib],
@@ -28,19 +29,23 @@ void librarySort(int *index, int n) {
// if there is no gap to insert a new index ...
if (numbered[insert] == true) {
if (numbered[insert] == true)
{
int prov_size = 0, next_target_lib = !target_lib;
// update library and clear gaps
for (int i = 0; i <= n; i++) {
if (numbered[i] == true) {
for (int i = 0; i <= n; i++)
{
if (numbered[i] == true)
{
library[next_target_lib][prov_size] = gaps[i];
prov_size++;
numbered[i] = false;
}
if (i <= lib_size) {
if (i <= lib_size)
{
library[next_target_lib][prov_size] =
library[target_lib][i];
prov_size++;
@@ -49,7 +54,9 @@ void librarySort(int *index, int n) {
target_lib = next_target_lib;
lib_size = prov_size - 1;
} else {
}
else
{
numbered[insert] = true;
gaps[insert] = index[index_pos];
index_pos++;
@@ -57,14 +64,17 @@ void librarySort(int *index, int n) {
}
int index_pos_for_output = 0;
for (int i = 0; index_pos_for_output < n; i++) {
if (numbered[i] == true) {
for (int i = 0; index_pos_for_output < n; i++)
{
if (numbered[i] == true)
{
// std::cout << gaps[i] << std::endl;
index[index_pos_for_output] = gaps[i];
index_pos_for_output++;
}
if (i < lib_size) {
if (i < lib_size)
{
// std::cout << library[target_lib][i] << std::endl;
index[index_pos_for_output] = library[target_lib][i];
index_pos_for_output++;
@@ -72,15 +82,15 @@ void librarySort(int *index, int n) {
}
}
int main() {
int main()
{
// ---example--
int index_ex[] = {-6, 5, 9, 1, 9, 1, 0, 1, -8, 4, -12};
int n_ex = sizeof(index_ex) / sizeof(index_ex[0]);
librarySort(index_ex, n_ex);
std::cout << "sorted array :" << std::endl;
for (int i = 0; i < n_ex; i++)
std::cout << index_ex[i] << " ";
for (int i = 0; i < n_ex; i++) std::cout << index_ex[i] << " ";
std::cout << std::endl;
/* --output--