/// <summary>
/// Main method
/// </summary>
/// <param name="args">The arguments.</param>
public static void Main(string[] args)
{
try
{
string str = null;
do
{
Console.WriteLine("Enter 1 For Anagram Program");
Console.WriteLine("Enter 2 For Prime numbers");
Console.WriteLine("Enter 3 For Insertion Sort");
Console.WriteLine("Enter 4 For Bubble Sort");
Console.WriteLine("Enter 5 For Merge Sort");
Console.WriteLine("Enter 6 For Vending Machine");
Console.WriteLine("Enter 7 For Temperature");
Console.WriteLine("Enter 8 For Square Root");
Console.WriteLine("Enter 9 For Decimal to Binary");
Console.WriteLine("Enter 10 For Nibble");
Console.WriteLine("Enter 11 For Binary Search of integers");
Console.WriteLine("Enter 12 For Binary Search of strings");
Console.WriteLine("Enter 13 For Insertion Sort of integers");
Console.WriteLine("Enter 14 For Insertion sort of strings");
Console.WriteLine("Enter 15 For Bubble sort of integers");
Console.WriteLine("Enter 16 For Bubble sort of strings");
Console.WriteLine("Enter 17 For Anagram and palindrome of prime numbers");
Console.WriteLine("Enter 18 For Binary search");
int num = Convert.ToInt32(Console.ReadLine());
switch (num)
{
case 1:
Anagram a = new Anagram();
a.StringAnagram();
break;
case 2:
Primenumbers p = new Primenumbers();
p.Isprime();
break;
case 3:
InsertionSort ins = new InsertionSort();
ins.Sortingofstrings();
break;
case 4:
BubbleSort bs = new BubbleSort();
bs.Bubblesortofint();
break;
case 5:
MergeSort m = new MergeSort();
Console.WriteLine("enter size of array");
int size = Convert.ToInt32(Console.ReadLine());
string[] words = new string[size];
Console.WriteLine("enter strings in to array");
for (int k = 0; k < size; k++)
{
words[k] = Console.ReadLine();
}
m.Sort(words);
Console.WriteLine("sorted array");
foreach (string sortedArray in words)
{
Console.WriteLine(sortedArray);
Console.ReadLine();
}
break;
case 6:
VendingMachine v = new VendingMachine();
v.CountCurrency();
break;
case 7:
Temperature t = new Temperature();
t.TemperatureConversion();
break;
case 8:
SquareRoot sq = new SquareRoot();
sq.FindSquareRoot();
break;
case 9:
DecimaltoBinary db = new DecimaltoBinary();
db.ConversionofDecimal();
break;
case 10:
Nibble nb = new Nibble();
nb.ToBinary();
break;
case 11:
Console.WriteLine("Enter the size of Array:");
int arraysize = Utility.Getinteger();
int[] arr = new int[arraysize];
Console.WriteLine("Enter " + arraysize + " Elemenets");
for (int i = 0; i < arr.GetLength(0); i++)
{
arr[i] = Utility.Getinteger();
}
Console.WriteLine("Enter an item to search:");
int item = Utility.Getinteger();
Utility.BinarySearch(arr, item);
break;
case 12:
Console.WriteLine("Enter the size of Array:");
int sizeStr = Utility.Getinteger();
string[] s = new string[sizeStr];
Console.WriteLine("Enter " + sizeStr + " Elemenets");
for (int i = 0; i < s.GetLength(0); i++)
{
s[i] = Utility.GetString();
}
Console.WriteLine("Enter an item to search:");
string itemStr = Utility.GetString();
Utility.BinarySearch(s, itemStr);
break;
case 13:
Console.WriteLine("Enter the size of Array:");
int sizeIns = Utility.Getinteger();
int[] arrIns = new int[sizeIns];
Console.WriteLine("Enter " + sizeIns + " Elemenets");
for (int i = 0; i < arrIns.GetLength(0); i++)
{
arrIns[i] = Utility.Getinteger();
}
Utility.InsertionSort(arrIns);
break;
case 14:
Console.WriteLine("Enter the size of Array:");
int strsize = Utility.Getinteger();
string[] strIns = new string[strsize];
Console.WriteLine("Enter " + strsize + " Elemenets");
for (int i = 0; i < strIns.GetLength(0); i++)
{
strIns[i] = Utility.GetString();
}
Utility.InsertionSort(strIns);
break;
case 15:
Console.WriteLine("Enter the size of Array:");
int sizeBubInt = Utility.Getinteger();
int[] arrBubInt = new int[sizeBubInt];
Console.WriteLine("Enter " + sizeBubInt + " Elemenets");
for (int i = 0; i < arrBubInt.GetLength(0); i++)
{
arrBubInt[i] = Utility.Getinteger();
}
Utility.BubbleSort(arrBubInt);
break;
case 16:
Console.WriteLine("Enter the size of Array:");
int strsizeBub = Utility.Getinteger();
string[] strBub = new string[strsizeBub];
Console.WriteLine("Enter " + strsizeBub + " Elemenets");
for (int i = 0; i < strBub.GetLength(0); i++)
{
strBub[i] = Utility.GetString();
}
Utility.BubbleSort(strBub);
break;
case 17:
AnagramAndPalindrome Ap = new AnagramAndPalindrome();
Ap.PalindromeOfPrimeNumbers();
Ap.AnagramOfPrimeNumbers();
break;
case 18:
BinarySearch binarysearch = new BinarySearch();
binarysearch.ReadFile();
break;
default:
Console.WriteLine("Please enter the valid input");
Console.ReadLine();
break;
}
}while(str != "n");
Console.ReadLine();
}
catch (Exception e)
{
Console.WriteLine(e.Message);
}
}
static void Main(string[] args)
{
Console.WriteLine("Functional programming");
Console.WriteLine("----------------------");
Console.WriteLine(" 1. All permutations of a String using iterative method and Recursion method");
Console.WriteLine(" 2.Binary Search the Word from Word List");
Console.WriteLine(" 3.Insertion sort in string");
Console.WriteLine(" 4.Reads in integers prints them in sorted order using Bubble Sort");
Console.WriteLine(" 5.Write a program to do Merge Sort of list of Strings.");
Console.WriteLine(" 6.ne string is an anagram of another if the second is simply a rearrangement of the first");
Console.WriteLine(" 7. Take a range of 0 - 1000 Numbers and find the Prime numbers in that range. ");
Console.WriteLine(" 8. Extend the above program to find the prime numbers that are Anagram and Palindrome ");
Console.WriteLine(" 9.Rewrite Use Generics for Search and Sort Algorithms");
Console.WriteLine(" 10.Question to find your number");
Console.WriteLine(" 11.maximum amount by which a task's completion time overshoots its deadline is minimized.");
//Console.WriteLine("12.Customize Message Demonstration using String Function and RegEx");
//Console.WriteLine("13.Coupone Number");
//Console.WriteLine("14.Stop watch");
//Console.WriteLine("15.Tic Toe Tik");
//Console.WriteLine("16.Vending Machine");
//Console.WriteLine("17.dayOfWeeks");
//Console.WriteLine("18.celcius to Ferhinheit and vic versa");
//Console.WriteLine("19.Monthly pament");
//Console.WriteLine("20.Newton method");
//Console.WriteLine("21.Decimal to binary");
//Console.WriteLine("22.swap nibble");
int str = int.Parse(Console.ReadLine());
switch (str)
{
case 1:
PermutationOfString.Permu();
break;
case 2:
BinarySearch.Binary();
break;
case 5:
MergeSort.Merge1();
break;
//case 4:
// HarmonicNumber.Harmonic();
// break;
case 3:
InsertionSort.Insertion();
break;
//case 6:
// FactorNumber.Factor();
// break;
//case 7:
// TwoDArray.Two();
// break;
//case 8:
// SumOfThree.Sum();
// break;
//case 9:
// Distance.Dist();
// break;
//case 10:
// Quadratic.Quad();
// break;
//case 11:
// WindChill.Wind();
// break;
//case 12:
// Gambler.Game();
// break;
//case 13:
// Cupon_number.Cupon();
// break;
//case 14:
// Stopwatchs.Stop();
// break;
//case 15:
// TicTakTeo.Tic();
// break;
//case 16:
// VendingMachine.Vending();
// break;
//case 17:
// DaysOfWeek.Days();
// break;
//case 18:
// TemperatureConversion.Temperature();
// break;
//case 19:
// MonthlyPayment.Payment();
// break;
default:
break;
}
}
/// <summary>
/// Defines the entry point of the application.
/// </summary>
/// <param name="args">The arguments.</param>
static void Main(string[] args)
{
Console.WriteLine("1: Anagram Detection");
Console.WriteLine("2: Prime Numbers between 0-1000");
Console.WriteLine("3: Prime Numbers that are Anagram or Palindrome (0-1000)");
Console.WriteLine("4: Utility Class");
Console.WriteLine("5: Find Number");
Console.WriteLine("6: Binary Search");
Console.WriteLine("7: Insertion Sort");
Console.WriteLine("8: Bubble Sort");
Console.WriteLine("9: Merge Sort");
Console.WriteLine("10: Vending Machine");
Console.WriteLine("11: Day of Week");
Console.WriteLine("12: Temperature Conversion");
Console.WriteLine("13: Monthly Payment");
Console.WriteLine("14: Square Root");
Console.WriteLine("15: To Binary");
Console.WriteLine("16: Binary Swap Nibbles");
int choice = 0;
while (!(choice > 0 && choice < 17))
{
try
{
Console.Write("Enter your choice: ");
choice = Convert.ToInt32(Console.ReadLine());
}
catch (FormatException)
{
//Console.WriteLine(Ex);
}
}
switch (choice)
{
case 1:
AnagramDetection anagramDetection = new AnagramDetection();
anagramDetection.anagram();
break;
case 2:
PrimeNumbers primeNumbers = new PrimeNumbers();
primeNumbers.prime();
break;
case 3:
PrimeAnagramPalindrome primeAnagramPalindrome = new PrimeAnagramPalindrome();
primeAnagramPalindrome.checkForPrimeAnagramPalindrome();
break;
case 4:
int[] integerArray = { 10, 8, 7, 4, 3, 5, 0, 1, 2, 6, 9 };
integerArray = Utility.BubbleSort(integerArray);
Console.WriteLine("After Bubble Sort:");
for (int i = 0; i < integerArray.Length; i++)
{
Console.Write(integerArray[i] + " ");
}
Console.WriteLine();
int pos1 = Utility.BinarySearch(6, 0, 11, integerArray);
if (pos1 == -1)
{
Console.WriteLine("Not Found!");
}
else
{
Console.WriteLine("Found at location: " + pos1);
}
Console.WriteLine();
string[] stringArray = { "saad", "fahad", "saba", "zeeshan", "ashhar", "owais" };
stringArray = Utility.BubbleSort(stringArray);
Console.WriteLine("After Bubble Sort:");
for (int i = 0; i < stringArray.Length; i++)
{
Console.Write(stringArray[i] + " ");
}
int pos2 = Utility.BinarySearch("saad", 0, 11, stringArray);
Console.WriteLine();
if (pos2 == -1)
{
Console.Write("Not Found!");
}
else
{
Console.Write("Found at location: " + pos2);
}
break;
case 5:
FindingNumber findingNumber = new FindingNumber();
findingNumber.Find();
break;
case 6:
BinarySearch search = new BinarySearch();
search.binarySearch();
break;
case 7:
InsertionSort insertionSort = new InsertionSort();
insertionSort.Sort();
break;
case 8:
BubbleSort bubbleSort = new BubbleSort();
bubbleSort.Sort();
break;
case 9:
MergeSort mergeSort = new MergeSort();
mergeSort.Sort();
break;
case 10:
VendingMachine vendingMachine = new VendingMachine();
vendingMachine.machine();
break;
case 11:
DayOfWeek dayOfWeek = new DayOfWeek();
dayOfWeek.getDay();
break;
case 12:
TemperatureConversion conversion = new TemperatureConversion();
conversion.temperatureConversion();
break;
case 13:
MonthlyPayment monthlyPayment = new MonthlyPayment();
monthlyPayment.payment();
break;
case 14:
SquareRoot root = new SquareRoot();
root.calculateSquareRoot();
break;
case 15:
ConvertToBinary convert = new ConvertToBinary();
convert.conversion();
break;
case 16:
BinarySwapNibbles binarySwapNibbles = new BinarySwapNibbles();
binarySwapNibbles.swapNibbles();
break;
default:
Console.WriteLine("Wrong Choice!");
break;
}
}
static void Main(string[] args)
{
Console.WriteLine("select your choice : ");
Console.WriteLine(" 1 -> Permutations Of a String program ");
Console.WriteLine(" 2 -> Binary Search the Word from Word List program ");
Console.WriteLine(" 3 -> Insertion Sort program ");
Console.WriteLine(" 4 -> Bubble Sort program ");
Console.WriteLine(" 5 -> Merger Sort program ");
Console.WriteLine(" 6 -> Anagram Detection program ");
Console.WriteLine(" 7 -> Prime Number program ");
Console.WriteLine(" 8 -> Primenumber_Palindrome_Anagram program ");
Console.WriteLine(" 9 -> program ");
Console.WriteLine("10 -> Guess Number Game program ");
Console.WriteLine("11 -> ListOfTask program ");
Console.WriteLine("12 -> program ");
Console.Write("enter your choice : ");
int choice = Utility.Util.ReadInt();
switch (choice)
{
case 1:
StringPermutation sp = new StringPermutation();
sp.StringPermutationMethod();
break;
case 2:
BinarySearch binarysearch = new BinarySearch();
binarysearch.BinarySearchMethod();
break;
case 3:
InsertionSort insertionsort = new InsertionSort();
insertionsort.InsertionSortMethod();
break;
case 4:
BubbleSort bubblesort = new BubbleSort();
bubblesort.BubbleSortMethod();
break;
case 5:
MergeSort mergesort = new MergeSort();
mergesort.MergeSortMethod();
break;
case 6:
Anagram anagram = new Anagram();
anagram.AnagramMethod();
break;
case 7:
PrimeNumber prime = new PrimeNumber();
prime.PrimeNumberMethod();
break;
case 8:
PalindromeAndAnagram pna = new PalindromeAndAnagram();
pna.PalindromeAndAnagramMethod();
break;
case 10:
GuessNumber guessnumber = new GuessNumber();
guessnumber.GuessNumberMethod();
break;
case 11:
ListOfTask lot = new ListOfTask();
lot.ListOfTaskMethod();
break;
default:
break;
}
}
public static void Main(string[] args)
{
var items = new int[] { 3, 1, 6, 4, 5, 2 };
var insertionSort = new InsertionSort();
var count = insertionSort.Sort(items);
Console.WriteLine(string.Join(",", items));
Console.WriteLine(count);
//var bubbleSort = new BubbleSort();
//var count = bubbleSort.OptimizedSort(items);
//Console.WriteLine(string.Join(",", items));
//Console.WriteLine(count);
//var missing = new HashSet<int>();
//var store = new HashSet<int>();
//int count = 0;
//int max = 0;
//for (int i = 0; i < a.Length; i++)
//{
// max = Math.Max(max, a[i]);
// if(max == i + 1)
// {
// count++;
// }
//}
//for (int i = 0; i < a.Length; i++)
//{
// if (!store.Contains(i + 1) && i + 1 != a[i])
// missing.Add(i + 1);
// if (i + 1 < a[i])
// store.Add(a[i]);
// else
// missing.Remove(a[i]);
// if (missing.Count() == 0)
// count++;
//}
//WorkPerform del1 = new WorkPerform(WorkPerform1);
//WorkPerform del2 = new WorkPerform(WorkPerform2);
//del1 += del2;
//del1(5, WorkType.GoToMeeting);
//Func<int, int, int> func = (x, y) => x * y;
//Console.WriteLine(func(2, 3));
//string S = "Sun 10:00-20:00\nFri 05:00-10:00\nFri 16:30-23:50\nSat 10:00-24:00\nSun 01:00-04:00\nSat 02:00-06:00\nTue 03:30-18:15\nTue 19:00-20:00\nWed 04:25-15:14\nWed 15:14-22:40\nThu 00:00-23:59\nMon 05:00-13:00\nMon 15:00-21:00";
//int totalTime = 7 * 24 * 60;
//List<string> schedules = S.Split('\n').ToList();
//Dictionary<string, Time> abc = new Dictionary<string, Time>();
//string[] days = { "Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"};
//List<string> final = new List<string>();
//for (int i = 0; i < days.Count(); i++)
//{
// var d = schedules.Where(x => x.Contains(days[i])).ToList();
// List<string> temp = new List<string>();
// for (int j = 0; j < d.Count(); j++)
// {
// temp.Add(d[j].Substring(4, 11));
// }
// temp.Sort();
// final.AddRange(temp);
//}
//int maxMinutes = 0;
//for (int i = 0; i < final.Count - 1; i++)
//{
// int startTime;
// int endTime;
// int time;
// if (i == final.Count - 1)
// {
// startTime = int.Parse(final[i].Substring(6, 2)) * 60 + int.Parse(final[i].Substring(9, 2));
// endTime = int.Parse(final[0].Substring(0, 2)) * 60 + int.Parse(final[0].Substring(3, 2));
// }
// else
// {
// startTime = int.Parse(final[i].Substring(6, 2)) * 60 + int.Parse(final[i].Substring(9, 2));
// endTime = int.Parse(final[i + 1].Substring(0, 2)) * 60 + int.Parse(final[i + 1].Substring(3, 2));
// }
// if(endTime < startTime)
// {
// time = (24 * 60) - startTime + endTime;
// }
// else
// {
// time = endTime - startTime;
// }
// if (maxMinutes < time)
// {
// maxMinutes = time;
// }
//}
//return maxMinutes;
// schedule = schedule
//.OrderBy(d => DateTime.ParseExact(d, "dd'/'MM'/'yyyy", CultureInfo.InvariantCulture))
//.ToArray();
// var max_profit = 0;
// var min = 200001;
// for (var i = 0; i < A.Length; i++)
// {
// if (min > A[i])
// {
// min = A[i];
// }
// else
// {
// max_profit = Math.Max(max_profit, A[i] - min);
// }
// }
// return max_profit;
//return dp[A.length - 1];
//return count;
//return numSlice;
}
