Linear search, C# - rextester

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            
            // Linear search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. 
            // Every item is checked and if a match is found then that particular item is returned, 
            // otherwise the search continues till the end of the data collection.
            
            //Your code goes here
            Console.WriteLine("Hello, world!"); 
            int [] nums = getList();
            int toFind = 4;
            
           
            for(int indx=0; indx < nums.Length; indx++){
                if(toFind == nums[indx]){
                    Console.WriteLine("Search success, " + toFind); 
                    return;
                }
            }
            
        }
        
        public static int[] getList(){
            int [] nums = { 8,4,6,3,9,2 };
            return nums;
        }
            
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,14 sec, absolute running time: 0,14 sec, cpu time: 0,11 sec, average memory usage: 11 Mb, average nr of threads: 2, absolute service time: 0,3 sec