hsynkrcf

public class Phone
{
    public PhoneType Type { get; set; }
}
public enum PhoneType
{
    Iphone,
    Samsung
}
public class Iphone : Phone

hsynkrcf

public class PhoneFactory
{
    public void MakePhone(Phone phone)
    {
        switch (phone.Type)
        {
            case PhoneType.Iphone:
                MakeIphone((Iphone)phone);
                break;
            case PhoneType.Samsung:

hsynkrcf

class Program
{
    static void Main(string[] args)
    {
        PhoneFactory pf1 = new PhoneFactory();
        pf1.MakePhone(new Iphone());
        PhoneFactory pf2 = new PhoneFactory();
        pf2.MakePhone(new Samsung());
        Console.ReadLine();
    }

hsynkrcf

public abstract class Phone
{
    public abstract void Make();
}

public class Iphone : Phone
{
    public override void Make()
    {
        Console.WriteLine("Iphone Created\n");

hsynkrcf

public class PhoneFactory
{
    public void MakePhone(Phone phone)
    {
        phone.Make();
    }
}

hsynkrcf

class Program
{
    static void Main(string[] args)
    {
        PhoneFactory pf1 = new PhoneFactory();
        pf1.MakePhone(new Iphone());
        
        PhoneFactory pf2 = new PhoneFactory();
        pf2.MakePhone(new Samsung());
        

hsynkrcf

using OpenQA.Selenium;

public static class HourSelector
{
    public static (int, int)? SelectHour(IWebElement element, bool isSaturday)
    {
        const string satHour = "08:00 - 09:00";  // Weekends saturday time
        const string eachHours = "18:30 - 19:30"; // Weekdays time

        for (int repeater = 0; repeater <= 13; repeater++)  // 13 repeater count

hsynkrcf

public int[] BubbleSort(int[] arr)
{
    int n = arr.Length;
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < n - i - 1; j++)
        {
            if (arr[j] > arr[j + 1])
            {
                int temp = arr[j];

hsynkrcf

public int[] SelectionSort(int[] arr)
{
    int n = arr.Length;
    for (int i = 0; i < n - 1; i++)
    {
        int minIdx = i;
        for (int j = i + 1; j < n; j++)
        {
            if (arr[j] < arr[minIdx])
            {

hsynkrcf

public int[] QuickSort(int[] arr, int low, int high)
{
    if (low < high)
    {
        int pi = Partition(arr, low, high);
        QuickSort(arr, low, pi - 1);
        QuickSort(arr, pi + 1, high);
    }
    
    return arr;