Working with Multithreaded programming!

Question

I've justed read some lessons about Multithread Programming, but I don't understand it clearly. There is an example of Multithreaded programming with C#: Calculate N! (N may be greater then 1000) I need someone else to help me. Thanks in advance!

lazypanda20002000 · Answer

Hix ! The solution of Uz is not clearly to me ! hix ! Can U add more comment for each code line . I will show the code using multitheaded in C#  but this solution doesn't process with N = 1000 and be limited but it is easy to see . Can U repair it ? using System; using System.Threading; class Mythread { public void Factorial() { int n; Console.Write(enter n:=); n = Int32.Parse(Console.ReadLine()); double gt=1; for(int i=1;i<=n;i++) { gt=gt*i; } Console.Write(n factorial:= +gt); } } class App { public static void Main() { Mythread th = new Mythread(); Thread me = new Thread(new ThreadStart(th.Factorial)); me.Start(); Console.ReadLine(); } }

truongdieulinh · Answer

Thank for your help!

lazypanda20002000 · Answer

I will try now :)

lazypanda20002000 · Answer

Wow quick reply ! Thankssss Uz ;)

uzir · Answer

Hi Does this help? using System; using System.Threading; using System.Runtime.Remoting.Messaging; // create a delegate to the method to be called asynchronously public delegate bool FactorizeDelegate( int factorizableNum ref int primefactor1 ref int primefactor2); // a class that factorizers the number public class PrimeFactorizer { // method to be called public bool Factorize( int factorizableNum ref int primefactor1 ref int primefactor2) { primefactor1 = 1; primefactor2 = factorizableNum; // Factorize using a low-tech approach. for (int i=2;i<factorizableNum;i++) { if (0 == (factorizableNum % i)) { primefactor1 = i; primefactor2 = factorizableNum / i; break; } } if (1 == primefactor1 ) return false; else return true ; } } // class calls factorizer anychronously public class Simple { private int factorizableNum = 1000589023; static AutoResetEvent asyncOpDone = new AutoResetEvent(false); // The following demonstrates the Asynchronous Pattern using a callback. public void FactorizeNumber() { int temp=0; // Create the object to do the work and a delegate to the worker method. PrimeFactorizer pf = new PrimeFactorizer(); FactorizeDelegate fd = new FactorizeDelegate(pf.Factorize); // Define the AsyncCallback delegate. AsyncCallback cb = new AsyncCallback(this.FactorizedResults); // Asynchronously invoke the Factorize method on pf. IAsyncResult ar = fd.BeginInvoke( factorizableNum ref temp ref temp cb null); } public void FactorizedResults(IAsyncResult ar) { int factor1=0 factor2=0; // Extract the delegate from the AsyncResult. (Could also have stored the // delegate in a member variable.) FactorizeDelegate fd = (FactorizeDelegate)((AsyncResult)ar).AsyncDelegate; // Obtain the result. fd.EndInvoke(ref factor1 ref factor2 ar); // Output results. Console.WriteLine(On CallBack: Factors of {0} : {1} {2} factorizableNum factor1 factor2); // For demo purposes: signal that the async op is done. asyncOpDone.Set(); } public static void Main(String[] args) { Simple simple = new Simple(); simple.FactorizeNumber(); // don't want to let Main exit until the async op is done. asyncOpDone.WaitOne(); } } yours Uz

lazypanda20002000 · Answer

with N = 1000 :D

lazypanda20002000 · Answer

yeah ! :) Question :Multithreaded programming using C# for calculating N ! (N factorials) :)

uzir · Answer

Hi Can you be clearer as to the specific question? Thanx Uz

lazypanda20002000 · Answer

Oh yeah hix :(( I dont understand about using multi threads too :( but if using multithreaded programming using C# for calculating N ! (N factorials ) I think It cannot using System; using System.threading; public void cal () { long result = 1; for(int i=1; i<=N; i++) { result *= i; } Console.WriteLine ( result =  ); Console.ReadLine(); } public static void Main() { System.Threading.ThreadStart ts = new System.Threading.ThreadStart(cal); System.Threading.Thread t = new System.Threading.Thread(ts); t.Start(); } N ! with N = 1000 ! Hmm  may be too large ! Is there anybody here to help us ???