Пример #1
0
        public static void Prime()
        {
            Console.WriteLine("the range of integer from 0 to 1000");

            IntLL.Node2[] arr = new IntLL.Node2[10];
            //so create a linked list for each range our range is 10 ,that's why taken 10.
            IntLL a = new IntLL();
            IntLL b = new IntLL();
            IntLL c = new IntLL();
            IntLL d = new IntLL();
            IntLL e = new IntLL();
            IntLL f = new IntLL();
            IntLL g = new IntLL();
            IntLL h = new IntLL();
            IntLL l = new IntLL();
            IntLL k = new IntLL();

            for (int i = 2; i <= 1000; i++)
            {
                int count = 0;
                for (int j = 1; j <= i; j++)
                {
                    if (i % j == 0)
                    {
                        count++;
                    }
                }
                //prime no is comming...so now we have to store the no in the range
                if (count == 2)
                {
                    //if no is lies between 0-99
                    if (i >= 2 && i <= 99)
                    {
                        arr[0] = a.AddLast(i);
                    }
                    if (i >= 100 && i <= 199)
                    {
                        arr[1] = b.AddLast(i);
                    }
                    if (i >= 200 && i <= 299)
                    {
                        arr[2] = c.AddLast(i);
                    }
                    if (i >= 300 && i <= 399)
                    {
                        arr[3] = d.AddLast(i);
                    }
                    if (i >= 400 && i <= 499)
                    {
                        arr[4] = e.AddLast(i);
                    }
                    if (i >= 500 && i <= 599)
                    {
                        arr[5] = f.AddLast(i);
                    }
                    if (i >= 600 && i <= 699)
                    {
                        arr[6] = g.AddLast(i);
                    }
                    if (i >= 700 && i <= 799)
                    {
                        arr[7] = h.AddLast(i);
                    }
                    if (i >= 800 && i <= 899)
                    {
                        arr[8] = k.AddLast(i);
                    }
                    if (i >= 900 && i <= 1000)
                    {
                        arr[9] = l.AddLast(i);
                    }
                }
            }

            a.Display(100);
            b.Display(200);
            c.Display(300);
            d.Display(400);
            e.Display(500);
            f.Display(600);
            g.Display(700);
            h.Display(800);
            k.Display(900);

            l.Display(1000);
        }
Пример #2
0
        public static void Hash()
        {
            string newpath = @"C:\Users\Neelabh\Desktop\GitHub\dataStructure\DataStructures\DataStructures\orderll.txt";
            string x       = System.IO.File.ReadAllText(newpath);

            string[] str = x.Split(" ");
            int      len = str.Length;

            int[] arr = new int[len];
            //store all the elements into an int arr from the list
            for (int i = 0; i < len; i++)
            {
                arr[i] = int.Parse(str[i]);
            }

            //now create a arr of size 10 for store those elements
            IntLL ll = new IntLL();

            IntLL.Node2[] arr1 = new IntLL.Node2[11];


            //so create a linked list for every arr index
            IntLL a = new IntLL();
            IntLL b = new IntLL();
            IntLL c = new IntLL();
            IntLL d = new IntLL();
            IntLL e = new IntLL();
            IntLL f = new IntLL();
            IntLL g = new IntLL();
            IntLL h = new IntLL();
            IntLL j = new IntLL();
            IntLL k = new IntLL();

            IntLL m = new IntLL();


            //...................................
            Utility uu = new Utility();

            for (int i = 0; i < len; i++)
            {
                int xx = uu.HashFunction(arr[i]);
                //i have used this one for create 11 linked list
                switch (xx)
                {
                case 0:

                    arr1[xx] = a.AddLast(arr[i]);

                    break;

                case 1:

                    arr1[xx] = b.AddLast(arr[i]);
                    break;

                case 2:

                    arr1[xx] = c.AddLast(arr[i]);
                    break;

                case 3:

                    arr1[xx] = d.AddFirst(arr[i]);
                    break;

                case 4:

                    arr1[xx] = e.AddLast(arr[i]);
                    break;

                case 5:

                    arr1[xx] = f.AddLast(arr[i]);
                    break;

                case 6:

                    arr1[xx] = g.AddLast(arr[i]);
                    break;

                case 7:

                    arr1[xx] = h.AddLast(arr[i]);
                    break;

                case 8:

                    arr1[xx] = j.AddLast(arr[i]);
                    break;

                case 9:

                    arr1[xx] = k.AddLast(arr[i]);
                    break;

                case 10:


                    arr1[xx] = m.AddLast(arr[i]);
                    break;

                default:
                    break;
                }
            }
            a.Display(0);
            b.Display(1);
            c.Display(2);
            d.Display(3);
            e.Display(4);
            f.Display(5);
            g.Display(6);
            h.Display(7);
            j.Display(8);
            k.Display(9);

            m.Display(10);
        }