Algorithm

Reverse And Sort Algo

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BlackLight.Recruitment.UnitTests
{
    class Algorithms
    {
        public static string ReverseWordsInString(string input)
        {
            string reversalstring = string.Empty;
            if (string.IsNullOrWhiteSpace(input))
            {
                return null;
            }

            try
            {
                string[] splitedstring = input.Split(' ');
                Array.Reverse(splitedstring);

                for (int i = 0; i <= splitedstring.Length - 1; i++)
                {
                    reversalstring += splitedstring[i] + "" + ' ';
                }
                reversalstring = reversalstring.TrimEnd(' ');
            }
            catch (Exception ex)
            {
                throw new Exception(ex.Message);
            }

            return reversalstring;
        }

        public static string ReverseWordsInStringWithoutUsingAnyLinqMethods(string input)
        {
            string reversalstring = string.Empty;
            if (string.IsNullOrWhiteSpace(input))
            {
                return null;
            }

            try
            {
                int counter;
                string[] splitedstring = input.Split(' ');
                int totalindex = splitedstring.Length - 1;
                counter = totalindex;
                for (int i = totalindex; counter >= 0; totalindex--)
                {
                    reversalstring += splitedstring[counter] + "" + ' ';
                    --counter;
                }

                reversalstring = reversalstring.TrimEnd(' ');
            }
            catch (Exception ex)
            {
                throw new Exception(ex.Message);
            }

            return reversalstring;
        }

        internal static int[] SortWithoutUsingBuiltInSortMethods(int[] input)
        {
            int[] reversalNumber = new int[12];
            int cnt = input.Length - 1;
            for (int i = 0; i < cnt; i++)
            {
                for (int j = cnt; j > i; j--)
                {
                    if (((IComparable)input[j - 1]).CompareTo(input[j]) > 0)
                    {
                        var temp = input[j - 1];
                        input[j - 1] = input[j];
                        input[j] = temp;
                    }
                }
            }

            for (int i = 0; i < input.Length; i++)
            {
                reversalNumber[i] = input[i];
            }

            return reversalNumber;
        }
    }
}