while loop in MVC Razor engine

Definition

A while loop to repeat the execution of a sequence of statements as long as a certain Boolean condition is true. The Boolean condition to break out of the loop when the Boolean condition becomes false.

Example:

@{
    int i = 0;
    while (i < 15)
    {
        i++;
        <p>@i</p>
    }
}

Examples of use

Display integers in ascending order as the sum of the digits is strictly lower than 25.

@{

    int n = 0;
    while (n % 10 + (n / 10) % 10 + (n / 100) % 10 < 25)
    {
        @n;
        @Html.Raw("; ");
        n++;
    }
}

The result:

From a list of guests, show guests from the beginning until the first which was named John.

@{
    string[] guests = new string[] { "Paul Turner", "Donald Verner", "John Roberts", "Alison Kris", "Antonio Vivaldi" };
    int guest_number = guests.Length;
    int g = 0;
    bool contains = false;
}
<p>
    <ul>
        @while (g < guest_number && !contains)
        {
            contains = guests[g].Contains("John");
            @:
            <li>@guests[g]</li>
            g++;
        }
    </ul>
</p>

Result:

View the result of the throw of a dice if the sum of all results from the first launch remains below 20.

@helper Index(int i)
{
    string[] term = new string[] { "1st", "2nd", "3rd", "{0}th" };
    if (i <= 3)
    {
        @term[i - 1];
    }
    else
    {
        @String.Format(term[3], i.ToString());
    }
}

@{
    int num = 1;
    int res = 0;
    long sum = 0;
    Random r = new Random();
    res = r.Next(6);
    sum = res;
    @:<ul>
        @:<li>
            @Index(num) roll -> @res
            @Html.Raw(" (sum = " + sum.ToString() + ")");
        @:</li>
    res = r.Next(6);
    sum += res;
    num++;
    while (sum <= 20)
    {
        @:<li>
            @Index(num) roll -> @res
            @Html.Raw(" (sum=" + sum.ToString() + ")");
        @:</li>
        res = r.Next(6);
        sum += res;
        num++;
    }
    @:</ul>
}

Result:

100m sprint, it wishes to make a preselection to keep only the riders who have a score lower 11s.

@{
    string[] sprinters = new string[] { "Ben Johnson", "John Timer", "Oliver Hardy", "Jaimie Sommers", "Julia Gonzales" };
    double[] score = new double[] { 9.83, 12, 20, 5, 10 };
    int l = sprinters.Length;
    Array.Sort(score, sprinters);
    int p = 0;
    bool not_ended = true;

    @Html.Raw("<ol>");
    while (p < l && not_ended)
    {
        not_ended = (score[p] <= 11);
        if (not_ended)
        {
            @Html.Raw("<li>" + sprinters[p] + string.Format(" (score: {0}s)", score[p]) + "</li>");
        }
        p++;
    }
    @Html.Raw("</ol>");
}

Result:

From a series of numbers, we want all the sequences corresponding to the steps of the bubble sort. Show the coloring permutations in the two swapped numbers.

@{
    int[] tab = new int[] { 0, 5, 6, 10, -5, 45, -100, 2 };
    bool not_sorted = true;
    int m = tab.Length;
    int len = m;
    @:<ul>
    while (not_sorted)
    {
        not_sorted = false;
        m--;
        for (int i = 0; i < m; i++)
        {
            if (tab[i] > tab[i + 1])
            {
                int x = tab[i];
                tab[i] = tab[i + 1];
                tab[i + 1] = x;
                not_sorted = true;
                @:<li>
                int j = 0;
                while (j < len)
                {
                    if (j == i)
                    {
                        @:<span style="background-color:blue;color:aliceblue"> @tab[i] @tab[i + 1] </span>
                        j++;
                    }
                    else
                    {
                        @:<span style="background-color:yellow;color:mediumvioletred"> @tab[j] </span>
                    }
                    j++;
                }
                @:</li>
            }
        }
    }
    @:</ul>
}

Result:

• 0 5 6 -5 10 45 -100 2
• 0 5 6 -5 10 -100 45 2
• 0 5 6 -5 10 -100 2 45
• 0 5 -5 6 10 -100 2 45
• 0 5 -5 6 -100 10 2 45
• 0 5 -5 6 -100 2 10 45
• 0 -5 5 6 -100 2 10 45
• 0 -5 5 -100 6 2 10 45
• 0 -5 5 -100 2 6 10 45
• -5 0 5 -100 2 6 10 45
• -5 0 -100 5 2 6 10 45
• -5 0 -100 2 5 6 10 45
• -5 -100 0 2 5 6 10 45
• -100 -5 0 2 5 6 10 45