source code of merge sort in visual basic?
85269
check out http://www.planet-source-code.com
587883
Select all the data that belongs together first. \nIn my version, you then go to the menu: 'DATA' - 'SORT' \nYou can choose the row to sort, or in the tab 'Options' you can choose to sort columns.\n\nExperiment on a separate sheet so you can see how it works.
1143912
There's no such site, as far as I'm aware.\nI don't think it's possible to convert from VB to C, because it would be too difficult (READ: impossible!) to do such a thing (they are too different programing languages, one is compiled, one interpreted...). You'd better try to understand the algorithm(s) in the programs and rewrite the code!
140606
Remember to vote for the best answer\n\nExample and online help here :\nhttp://www.vb-helper.com/howto_disk_quicksort.html\n\n\n\n    \nBubbleSort Sub Code\nThis version of the BubbleSort sub is an ascending sort of an integer array. Add this sub to a project right after you start the project. Place the sub in a module for global scope.
447556
Look up "quicksort".\n\nIt fits very naturally into a recursive implementation\nand is also a very efficient sorting algorithm.\n\nI've included a link to the Solaris source for quicksort.\nIt is written in C (rather than C++).  It is somewhat\ncomplicated because it optimizes the sorting of\nshort sequences by switching to an insertion sort.\nHowever, you could implement a simpler version which\nran quicksort all the way to completion.
102513
Sorts:\n\n http://www.programmersheaven.com/zone3/cat475/index.htm\n\nBinary search:\n\n http://physicsresearch.may.ie/yr3compphys/BorlandC2004.doc
860428
u gotta use somesort of code
1019358
Here's 17 different implementations. Take your pick...\nhttp://www.planetsourcecode.com/vb/scripts/BrowseCategoryOrSearchResults.asp?txtCriteria=Tic+Tac+Toe&blnWorldDropDownUsed=TRUE&txtMaxNumberOfEntriesPerPage=10&blnResetAllVariables=TRUE&lngWId=10&optSort=Alphabetical
234455
Try PlanetSourceCode:\n\nhttp://www.planetsourcecode.com/vb/default.asp?lngWId=4
966661
check out http://www.pscode.com for examples.  You would need to use ADO.NET in addition to VB.NET in order to obtain the required data.
908020
http://www.vb-helper.com/tips7.htm\n\nSorry I don't personally know about VB so I done a search for you\nI hope this helps, :)
538436
Copy the code here: http://www.ozgrid.com/VBA/Sort.htm and follow the instructions in the middle of the page that begin: "To use this UDF push Alt+F11..."
235678
you can do that by sorting the data source from where you are populating the list. Or while you are populating the list.\nIf you can tell me how you are populating, I can give you more pointers. I am not sure if there is any way to sort a list directly in java script.\n\njainnys\nMind Experts Inc.\nhttp://www.mindexp.com
332681
I have found the following site to be the best with free/complete projects with source code for Visual Basic\n\nhttp://www.planet-source-code.com/
923765
Public Function FindDelimitedString(ByVal s As String, ByVal startDelimiter As String, ByVal EndDelimiter As String) As String\n        Dim beginPosition As Integer\n        Dim endPosition As Integer\n\n        If (s.Length > startDelimiter.Length + EndDelimiter.Length) Then\n            beginPosition = s.IndexOf(startDelimiter)\n\n            If (beginPosition >= 0) Then\n                beginPosition = beginPosition + startDelimiter.Length\n                endPosition = s.IndexOf(EndDelimiter, beginPosition)\n                If (endPosition >= 0) Then\n                    Return s.Substring(beginPosition, endPosition - beginPosition)\n                End If\n            End If\n        End If\n\n        Return String.Empty\n    End Function
577652
Since you specified that the language is "C", it's\nworth pointing out that the Ansi standard guarantees\nthat the implementation will include a "qsort" function.\n\nAll you need to do is write the simple comparison\nfunction which is passed to qsort, and you're done.\n\nI copied the following (including the little test program)\ndirectly from the qsort man page:\n\n#include <stdlib.h>\n#include <stdio.h>\n\nstatic int\nintcompare(const void *p1, const void *p2)\n{\n  int i = *((int *)p1);\n  int j = *((int *)p2);\n\n  if (i > j)\n    return (1);\n  if (i < j)\n    return (-1);\n  return (0);\n}\n\nint\nmain()\n{\n  int i;\n  int a[10] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };\n  size_t nelems = sizeof (a) / sizeof (int);\n\n  qsort((void *)a, nelems, sizeof (int), intcompare);\n\n  for (i = 0; i < nelems; i++)\n    (void) printf("%d ", a[i]);\n\n  (void) printf("&#92;n");\n  return (0);\n}\n\n\nSee the references for the man page as well as the\nsource from the OpenSolaris site.
904016
This will sort in ascending for 10 characters starting at col 1.\nadjust JCL continued parameters at col. 4+\n\n//step1 exec pgm=sort,region=1500K\n//sortin   dd dsn=sortin.filename,disp=shr\n//sortout dd dsn=sortout.filename,\n//            unit=sysda,\n//            disp=(,catlg,delete),\n//            space=(cyl,(10,2),rlse)\n//sortwk1 dd unit=sysda,\n//            space=(cyl,(500,100),rlse)\n...\n//sortwk4 dd unit=sysda,\n//           space=(cyl,(500,100),rlse)\n//sysout dd sysout=*\n//sysprint dd sysout=*\n//sysin dd *\n sort fields=(1,20,ch,a)\n/*\n\nor replacing //sysin by a pds, TSO member...\n//sysin dd dsn=sortfields(filename),\n// disp=shr