﻿ C# Sharp exercises: Bogosort - w3resource

# C# Sharp Searching and Sorting Algorithm Exercises: Bogosort

## C# Sharp Searching and Sorting Algorithm: Exercise-2 with Solution

Write a C# Sharp program to sort a list of elements using Bogosort sort.

In computer science, bogosort is a particularly ineffective sorting algorithm based on the generate and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted. It is not useful for sorting, but may be used for educational purposes, to contrast it with other more realistic algorithms.
Two versions of the algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input. An analogy for the working of the latter version is to sort a deck of cards by throwing the deck into the air, picking the cards up at random, and repeating the process until the deck is sorted. Its name comes from the word bogus.

Sample Solution:

C# Sharp Code:

``````using System;
using System.Collections.Generic;

namespace Bogo_sort
{
class Program
{
static void Main(string[] args)
{
List<int> list = new List<int>() { 2, 1, 3, 0 };
Console.WriteLine("Sorting...");
Bogo_sort(list, true, 5);
Console.WriteLine("Press any key to exit.");
}

static void Bogo_sort(List<int> list, bool announce, int delay)
{
int iteration = 0;
while (!IsSorted(list))
{
if (announce)
{
Print_Iteration(list, iteration);
}
if (delay != 0)
{
}
list = Remap(list);
iteration++;
}

Print_Iteration(list, iteration);
Console.WriteLine();
Console.WriteLine("Bogo_sort completed after {0} iterations.", iteration);
}

static void Print_Iteration(List<int> list, int iteration)
{
Console.Write("Bogo_sort iteration {0}: ", iteration);
for (int i = 0; i < list.Count; i++)
{
Console.Write(list[i]);
if (i < list.Count)
{
Console.Write(" ");
}
}
Console.WriteLine();
}
static bool IsSorted(List<int> list)
{
for (int i = 0; i < list.Count - 1; i++)
{
if (list[i] > list[i + 1])
{
return false;
}
}

return true;
}

static List<int> Remap(List<int> list)
{
int temp;
List<int> newList = new List<int>();
Random r = new Random();

while (list.Count > 0)
{
temp = (int)r.Next(list.Count);
list.RemoveAt(temp);
}
return newList;
}
}
}
```
```

Sample Output:

```Sorting...
Bogo_sort iteration 0: 2 1 3 0
Bogo_sort iteration 1: 3 1 0 2
Bogo_sort iteration 2: 1 2 3 0
Bogo_sort iteration 3: 0 2 3 1
Bogo_sort iteration 4: 2 1 0 3
Bogo_sort iteration 5: 2 0 3 1
Bogo_sort iteration 6: 3 1 2 0
Bogo_sort iteration 7: 1 3 0 2
Bogo_sort iteration 8: 2 0 1 3
Bogo_sort iteration 9: 1 2 3 0
Bogo_sort iteration 10: 1 0 2 3
----
Bogo_sort iteration 38: 1 0 3 2
Bogo_sort iteration 39: 0 1 2 3

Bogo_sort completed after 39 iterations.
Press any key to exit.
```

Flowchart:

C# Sharp Code Editor:

Contribute your code and comments through Disqus.

What is the difficulty level of this exercise?

﻿

New Content: Composer: Dependency manager for PHP, R Programming