Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
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
Please
log in
to post a comment.
Login Silencioso
Catch redirect link
if Two Words Are Anagrams of Each Other
Student Management System
Write a program to count the occurrence of each distinct item in the array?
Typing Words
f
Jerold
cff
findrotations
stackse - search stackoverflow differently
Please log in to post a comment.