Sorts an array of data using the insertion sort algorithm : Sort « Collections Data Structure « C# / C Sharp

Home C# / C Sharp 1. 2D Graphics 2. Class Interface 3. Collections Data Structure 4. Components 5. Data Types 6. Database ADO.net 7. Design Patterns 8. Development Class 9. Event 10. File Stream 11. Generics 12. GUI Windows Form 13. Language Basics 14. LINQ 15. Network 16. Office 17. Reflection 18. Regular Expressions 19. Security 20. Services Event 21. Thread 22. Web Services 23. Windows 24. Windows Presentation Foundation 25. XML 26. XML LINQ C# / C Sharp by API C# / CSharp Tutorial C# / CSharp Open Source

C# / C Sharp » Collections Data Structure » Sort Screenshots  Sorts an array of data using the insertion sort algorithm   using System; public class InsertionSort {        public static void InsertNext(int i, int[] item) {     int current = item[i];     int j = 0;     while (current > item[j]) j++;     for (int k = i; k > j; k--)       item[k] = item[k-1];     item[j] = current;   }   public static void Sort(int[] item) {     for (int i = 1; i < item.Length; i++) {       InsertNext(i, item);      }   }   public static void Main()  {     int[] item = new int[]{2,4,1,6,3,8,1,0,2,6,3,6};     Sort(item);     for(int i=0; i<item.Length;i++){         Console.WriteLine(item[i]);     }   } }                          Related examples in the same category 1. Implements the recursive merge sort algorithm to sort an array 2. Bubble sort 3. A simple version of the Quicksort 4. Demonstrate the Bubble sort 5. Insert Sort 6. A simple stable sorting routine - far from being efficient, only for small collections.