Insert Sort : 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  Insert Sort   using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Sort {     public class InsertSort     {         public int[] arrForSort = new int[100];         public InsertSort(int[] arr)         {             this.arrForSort = arr;         }         public int[] Execute()         {             int i, j, temp;             for (i = 1; i < arrForSort.Length; i++)             {                 temp = arrForSort[i];                 for (j = i; j > 0 && temp < arrForSort[j-1]; j--)                 {                     arrForSort[j] = arrForSort[j - 1];                 }                 arrForSort[j] = temp;             }             return arrForSort;         }     } }        Related examples in the same category 1. Implements the recursive merge sort algorithm to sort an array 2. Sorts an array of data using the insertion sort algorithm 3. Bubble sort 4. A simple version of the Quicksort 5. Demonstrate the Bubble sort 6. A simple stable sorting routine - far from being efficient, only for small collections.