算法 - 顺序查找（C#）

// --------------------------------------------------------------------------------------------------------------------
// <copyright company="Chimomo's Company" file="Program.cs">
// Respect the work.
// </copyright>
// <summary>
// The sequence search.
// </summary>
// --------------------------------------------------------------------------------------------------------------------

namespace CSharpLearning
{
    using System;

    /// <summary>
    /// The program.
    /// </summary>
    internal static class Program
    {
        /// <summary>
        /// The sequence search.
        /// 在a[0]-a[n-1]中顺序查找关键字为key的记录。查找成功时返回该记录的下标；失败时返回-1。
        /// </summary>
        /// <param name="a">
        /// The a.
        /// </param>
        /// <param name="key">
        /// The key.
        /// </param>
        /// <param name="n">
        /// The n.
        /// </param>
        /// <returns>
        /// The <see cref="int"/>.
        /// </returns>
        public static int SequenceSearch(int[] a, int key, int n)
        {
            int i = 0;
            while (i++ < n && a[i] != key)
            {
            }

            if (a[i] == key)
            {
                return i;
            }

            return -1;
        }

        /// <summary>
        /// Entry point into console application.
        /// </summary>
        private static void Main()
        {
            int[] a = { 1, 2, 4, 6, 3, 5, 8, 9, 7 };
            Console.WriteLine(SequenceSearch(a, 6, 9));
        }
    }
}

// Output:
/*
3
*/