Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
if Two Words Are Anagrams of Each Other
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Rextester.Program.Main is the entry point for your code. Don't change it. //Microsoft (R) Visual C# Compiler version 2.9.0.63208 (958f2354) using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { public class Program { public static char[] SortChrArray(char[] arrVal) { char temp; for (int i = 0; i <= arrVal.Length-1; i++) { for (int j = i+1; j < arrVal.Length; j++) { if (arrVal[i] < arrVal[j]) { temp = arrVal[i]; arrVal[i] = arrVal[j]; arrVal[j] = temp; } } } return arrVal; } public static void Main(string[] args) { //C# program to Determine if Two Words Are Anagrams of Each Other //Two words are said to be Anagrams of each other if they share the same set of letters to form the respective words. //for an example: Silent–>Listen, post–>opts.? //Builin array functions and LINQ are not allowed. Console.WriteLine("Start here..."); string str1 = "Listens"; string str2 = "Silent"; char[] ch1 = str1.ToLower().ToCharArray(); char[] ch2 = str2.ToLower().ToCharArray(); string val1 = new string(Program.SortChrArray(ch1)); string val2 = new string(Program.SortChrArray(ch2)); if (val1 == val2) { Console.WriteLine("Anagrams"); } else { Console.WriteLine("Not Anagrams"); } } } }
Show compiler warnings
[
+
]
Show input
Compilation time: 0,22 sec, absolute running time: 0,09 sec, cpu time: 0,11 sec, average memory usage: 15 Mb, average nr of threads: 3, absolute service time: 0,34 sec
edit mode
|
history
|
discussion
Start here... Not Anagrams