Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
comb sort
//Rextester.Program.Main is the entry point for your code. Don't change it. //Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5 using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { double gap = data.Length; bool swaps = true; while (gap > 1 || swaps) { gap /= 1.247330950103979; if (gap < 1) gap = 1; int i = 0; swaps = false; while (i + gap < data.Length) { int igap = i + (int)gap; if (data[i] > data[igap]) { int temp = data[i]; data[i] = data[igap]; data[igap] = temp; swaps = true; } ++i; } } }
run
|
edit
|
history
|
help
0
-Wall -std=c++14 -O0 -o a.out source_file.cpp
nthFromLastElement
Testing bitwise stuff
type experriment
DateTime.Now.Date
Anq Calc
QuickSort
Hash autoryzujący
Simplified login system
Fórum ➡ Border of a string S with at least 3 non-overlapping solutions ( yield version ) ♦