static void Main(string[] args) { Console.WriteLine("Welcome to datastructure programming"); Console.WriteLine("1.Unorder list"); Console.WriteLine("2.Order list"); Console.WriteLine("3.Balanched parentheses"); Console.WriteLine("4.Banking cash counter program"); Console.WriteLine("5.Palindrom Checker"); Console.WriteLine("6.Hashing"); Console.WriteLine("7.Prime no range"); Console.WriteLine("8.PrimeAnagram"); int x = int.Parse(Console.ReadLine()); switch (x) { case 1: Unorderlist.Unorder(); break; case 2: ListOrder.Order(); break; case 3: BalanchedParentheses.Parentheses(); break; case 4: BankingCashCounter.Banking(); break; case 5: PalindromChecker.palindrome(); break; case 6: Hashing.Hash(); break; case 7: PrimeNoRange.Prime(); break; case 8: PrimeAnagram1.PA(); break; default: break; } }
//anagram logic public void Aaanna() { PrimeAnagram1 pp = new PrimeAnagram1(); LinkedList2 b = new LinkedList2(); LinkedList2 c = new LinkedList2(); LinkedList2 d = new LinkedList2(); Node11 temp = head; while (temp != null) { //at first temp.data go to anagram method Node11 n = head; while (n != null) { //i have used 2 loops for anagram and if (PrimeAnagram1.Anagram(temp.data, n.data) == true) { //add the data in linked list b.Add(temp.data); //add the data into the queue c.AddinStake(temp.data); //add the linked list using queue d.AddiQueue(temp.data); break; } n = n.next; } temp = temp.next; } Console.WriteLine("prime and anagram................>"); b.Display(); Console.WriteLine("prime and anagram in reverse order using stack................>"); c.Display(); Console.WriteLine("prime and anagram in using queue................>"); d.Display(); }