Search Results

Binary Search Tree (BST) data structure - a binary tree where larger values are on the right side and smaller values are on the left side. This is an efficient structure that allows getting the values in sorted order. It is also a good example of working with trees where almost all tasks are done r
link: We want to help teachers teach programming and/or computer science with B4X. In this thread I will try to build a collection of classic algorithms tha

119022 This started as an educational project but it can be useful in some cases. Trie is an interesting data structure that allows fast lookup of prefix matches. It is a tree of prefixes. 119024 Source: https://en.wikipedia.org/wiki/Trie In the B4X implementation, each node holds a character, a

There is an example of a binary tree sort algorithm: https://www.b4x.-started-examples.57537/
link: Just trying to build a binary tree. But actually, I found out last night, that it might not have a single parent node at the top. Gotta re-think thi

The TreeMap is just a self balancing binary search tree. https://upload.wikimedia.-black_tree_example.svg/2000px-Red-black_tree_example.svg.png You would have to come up with a sorting scheme that ensured that there was only the required nodes under the primary key nodes. It may be possible to

This is an implementation of a sorted map using a red black self balancing binary search tree. It replaces the B4J TreeMap Library and the B4I Sorted Map Library. The .zip file includes demonstration / test programs for B4A,B4I and B4J. If you want to understand what the SortedMap class is doing

Welp, after reading some technical information about .zip headers, i am barking at the wrong tree. The point of the zip manipulation is to intentionally alter some bytes in the header and central directory. (Not corrupting the .zip to make it fubar). That is all for now.
link: 64 only means "@" in the context of a string of characters. wanting to exchange a byte's value from "@" to "/" only makes sense in the context of a s
link: Context is I am modifying some hex in a zip for a particular case for my experiment. I have posted the same case before (and I'd rather be more specif

Introduction: This collection is very similar to the Java TreeMap collection I wrapped for B4j and B4A a while back. However this version is written completely in B4X. It's based on a red black self balancing binary search tree. If you want to understand how this works take look at this superb vi

Now data = MergeSort(data) ToastMessageShow("Merge Sort took: " & (DateTime.Now - s) & " ms", False) DisplayData End Sub Sub mnuSelectionSort_Click Dim s As Long s = DateTime.Now SelectionSort ToastMessageShow("Selection Sort took: " & (DateTime.Now - s) & " ms", False)

Hola Carlos: No los he usado nunca en B4A (y creo que desde que los vi en la carrera, jeje), pero sí recuerdo haber visto algunos ejemplos en el foro, que si haces una búsqueda aparecen, hay una pequeña clase (Class) de Erel y algunos ejemplos básicos https://www.b4x./?query=binary+tree

This package includes several simple examples to help developers get start with B4J. The following examples are included: Hello World - One line example that prints Hello World. Guess My Number - The computer chooses a number. You need to guess the number. Three Pages - Example of an app with seve

Powered by ColBERT