gold Replay old scratch page on TCL Wiki. checking end of line issues here.
This page is under development. Comments are welcome, but please load any comments in the comments section at the bottom of the page. Please include your wiki MONIKER and date in your comment with the same courtesy that I will give you. Aside from your courtesy, your wiki MONIKER and date as a signature and minimal good faith of any internet post are the rules of this TCL-WIKI. Its very hard to reply reasonably without some background of the correspondent on his WIKI bio page. Thanks, gold 20Aug2020
gold Update 3/7/2024. Here are some calculations with Pseudocode outline reference to TCL Procedures.
gold Update 3/7/2024. The author is retired engineer on Windows 10 and no longer has proofing access to Unix machines. Unix is respected after use of so many decades in engineering, but my wings are lost. I did find a useful online IDE, jdoodle. I can paste from a text file, edit, and run an output using this online IDE.
This page on developing pseudocode examples and one line procedures is not a replacement for the current Tcl core and Tcllib, which is much improved since Tcl version 4, and other <faster> language constructs. math ops, Tcllib routines, and other compiled routines can reduce the cost of big-data tasks by about 1/3. The time savings of the core are not always obvious on small quantities of data, like 4 or 5 numbers. Performance of one-line programs may suffer degradation due to lengthy recursion calls, and may be limited by constraints on recursion. Dependence on math operator notation, helper procedures, math check examples, degradation due to lengthy recursion calls, and special library functions should be noted in the comment lines.
This modified subroutine, shuffle_with_fixed_first_and_last, takes a list as input and shuffles the inner list while keeping the first and last items in their original positions. The first and last items are extracted and stored in separate variables (first_item and last_item). The inner list is then obtained by removing the first and last items using lrange. The original shuffle subroutine is then called to shuffle the inner list. Finally, the shuffled inner list is concatenated with the first and last items, and the modified list is returned as the result.
1. `shuffle_list_items(list)`:
- This function takes a list as input.
- Initialize an empty list called `shuffled_list`.
- While the input list is not empty:
- Generate a random index between 0 and the length of the list.
- Add the list item at the random index to `shuffled_list`.
- Remove the same item from the input list.
- Return the `shuffled_list`.2. shuffle_list_with_fixed_first_and_last(list):
- This function shuffles the inner items of a list while keeping the first and last items fixed.
- If the input list has less than 2 items, return the original list (no shuffling needed).
- Extract the first and last items from the list.
- Create an `inner_list` by excluding the first and last items.
- Call the `shuffle_list_items` function on the `inner_list` to get a `shuffled_inner_list`.
- Concatenate the first item, `shuffled_inner_list`, and the last item to form the final `shuffled_list`.
- Return the `shuffled_list`.3. Example Usage:
- The provided print statements demonstrate how to use the `shuffle_list_with_fixed_first_and_last` function with different input lists:
- Shuffling the list `[c, a, t, c, h]`.
- Shuffling the list `[t, o, p]`.
- Shuffling the list `[b, o, b]`.
- Shuffling the list `[t, o]`.
- Shuffling the list `[a]`.
- Shuffling the list `[s, c, r, a, m, b, l, e, d]`.Please include your wiki MONIKER and date in your comment with the same courtesy that I will give you. Thanks, gold 12Aug2020
| Category Numerical Analysis | Category Toys | Category Calculator | Category Mathematics | Category Example | Toys and Games | Category Games | Category Application | Category GUI |