Skip to main content

How to use LINQ sorting operator in ASP.NET

Introduction

The Sorting operator in LINQ arranges the elements of a sequence based on one or more attributes. You can sort the data with one specific attribute and perform primary sorting on the elements. You can then specify the second sort criterion and sort the elements within the primary sorted group. The different Sorting operators are OrderBy, OrderByDescending, ThenBy, ThenByDescending, and Reverse.
The sorting functionality is achieved using the 'OrderBy operator. Sorting can either be ascending or descending. The default behavior of the OrderBy operator is to sort the data in ascending order. If you want to order your data in descending order, you need to use the OrderByDescending operator.
The syntax of using the OrderBy clause is:
C#
public static OrderedSequence<T> OrderBy<T, K>( this IEnumerable<T> source, Function<T, K> keySelector);

Similarly, you can use the OrderByDescending clause to sort the string in a descending order, as shown in the following code:

C#
public static OrderedSequence<T> OrderByDesceridinq<T, K>( this IEnumerable<T> source, Function<T, K> keySeIector);

Lets take an simple example 

Step-1 : Add one ListBox and two Button control on design window
   <form id="form1" runat="server">
    <div>
        <asp:ListBox ID="ListBox1" runat="server"></asp:ListBox>
        <br />
        <br />
        <asp:Button ID="Button1" runat="server" Text="Ascending" 
            onclick="Button1_Click" />
    &nbsp;<asp:Button ID="Button2" runat="server" Text="Descending " 
            onclick="Button2_Click" />
    </div>
    </form>
Step-2 : Handle business logic code on Button Click event.
Step-3 : Create double type array with some values.

 double [] dotprogramming = { 1, 2, 3, 4, 5, 6 };

Step-4 : Select filter type using OfType<string>(); extension IEnumerable.
Step-5 : Add filtered value into ListBox.

Output of given below code

How to use LINQ sorting operator in ASP.NET

How to use LINQ sorting operator in ASP.NET
public partial class Default8 : System.Web.UI.Page
{
    double [] dotprogramming = { 1, 2, 3, 4, 5, 6 };

    
    protected void Button1_Click(object sender, EventArgs e)
    {
        ListBox1.Items.Clear();
        var query = from d in dotprogramming
                    orderby d
                    select d;
        foreach (var item in query)
        {
            ListBox1.Items.Add(item.ToString() );
        }
    }
    protected void Button2_Click(object sender, EventArgs e)
    {
        ListBox1.Items.Clear();
        var query = from d in dotprogramming
                    orderby d descending
                    select d;
        foreach (var item in query)
        {
            ListBox1.Items.Add(item.ToString());
        }

    }
}

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …