cPLUSPLUS

[SHE.RE]

give example of a C++ program that sorts list of integers. The list should have a size of power of two. Example: list size = 2, 4, 8, 16…

Algorithm
1. Divide the array into two lists until a single element remains in any list

While merging given two sorted lists pull out the smallest element from the heads.

[deceptikon]

We won't do your homework for you. What have you tried?

[SHE.RE]

give example of a C++ program that sorts list of integers. The list should have a size of power of two. Example: list size = 2, 4, 8, 16…

Algorithm
1. Divide the array into two lists until a single element remains in any list

While merging given two sorted lists pull out the smallest element from the heads.

[deceptikon]

I can play that game too.

We won't do your homework for you. What have you tried?

[ddanbe]

I normally (just as decepticon) don't give solutions to homework.
I'll make an exception this time:

ref class Resource
{
private:
  bool disposed;
public:
  Resource()
  {
    disposed = false;
  }

  ~Resource() // IDisposable
  {
    Dispose(true);
  }

protected:
  !Resource() // Finalize
  {
    Dispose(false);
  }

  void Dispose(bool disposing)
  {
    if (disposing)
    {
      // dispose managed resources
    }
    // dispose unmanaged resources

    disposed = true;
  }
};