if wanting to 'produce permutation-with-various-member-amount' then example-input = 1 , 2 , 3 , 4 . if wanting to 'produce alphabet-capitalisation-and-maybe-number-and-maybe-special-alphabet-permutation' then example-input = a1bc-d . for alphabet-capitalisation-permutation : if expecting large-amount-of-output then divide large-amount-of-input to many-small-amount-of-input because if output grow bigger then memory-consumption grow bigger ... and if memory-consumption grow bigger then cpu-ability-to-work-fast decrease , but maybe i am wrong find 'memory-contention' for more info . 0 , 1 , 2 , 3

with number ? no yes produce permutation-with-various-member-amount produce alphabet-capitalisation-and-maybe-number-and-maybe-special-alphabet-permutation

console :

9 sep 2023 23:23 est-not-edt approximately or maybe-earlier-in-that-day : creation
21 apr 2019 2:1 pm edt=>2:8 pm edt:goal: 'The most direct solution would be to try all permutations (ordered combinations) and see which one is cheapest (using brute-force search). The running time for this approach lies within a polynomial factor of O(n!), the factorial of the number of cities, so this solution becomes impractical even for only 20 cities.' in https://en.wikipedia.org/wiki/Travelling_salesman_problem#22_jul_2018_2_55_pm_edt . but additional goal is for youtube.com-url-movie-id-alphabet-capitalisation-permutation .
11 oct 2023 5:16 pm est-not-edt : finish but maybe there is logical-defect , syntax-defect
20 oct 2023 3:50 pm est-not-edt : for alphabet-capitalisation-permutation : if expecting large-amount-of-output then divide large-amount-of-input to many-small-amount-of-input because if output grow bigger then memory-consumption grow bigger ... and if memory-consumption grow bigger then cpu-ability-to-work-fast decrease . so this java-script eventually concatenate very-long-word-output to more-word-output , and that is slower than concatenating short-word-output to more-word-output , and that very-long-word-output consume big-amount-of-memory .
example time-duration-consumption for alphabet-capitalisation-permutation :
input : iytv4qmhnla , dopptwgpksc , zbom74nbfjc , pxsimcsk-jg , 6a1o0peft1w , jhonbg15ljc , tavrd2zjgbi , _lyoc5xsmci , viy4vgoyydw , ola3xtzqbkk ,
ushmszmopgc , 8bl-6jhrrjk , mranbacmcok , mciwqb5sq74 , 68zzbdfptba , zvtjnxpfrbu , bri2feyiei8 , lrq9pf5f7mg , boubdkjnqak , ljq4atporxm ,
b_jmbqbsn44 , w7csaipuo3k
time-amount-duration :
start processing , current-time: 20-oct-2023 16:1:2 utc-5.
finished processing , current-time: 20-oct-2023 16:29:37 utc-5 , time-duration-amount spent : 1,714,990 mili-second.
1714990 / 60 = 28583.1666 = 29 minute ( 22 job )
=======================================================
input : iytv4qmhnla , dopptwgpksc , zbom74nbfjc , pxsimcsk-jg , 6a1o0peft1w , jhonbg15ljc , tavrd2zjgbi , _lyoc5xsmci , viy4vgoyydw , ola3xtzqbkk , ushmszmopgc
start processing , current-time: 20-oct-2023 15:17:29 utc-5.
finished processing , current-time: 20-oct-2023 15:23:5 utc-5 , time-duration-amount spent : 335,365 mili-second.
335365 / 60 = 5589.41666 = 6 minute ( 11 job )
=======================================================
input : 8bl-6jhrrjk , mranbacmcok , mciwqb5sq74 , 68zzbdfptba , zvtjnxpfrbu , bri2feyiei8 , lrq9pf5f7mg , boubdkjnqak , ljq4atporxm , b_jmbqbsn44 , w7csaipuo3k
start processing , current-time: 20-oct-2023 15:26:57 utc-5.
finished processing , current-time: 20-oct-2023 15:31:33 utc-5 , time-duration-amount spent : 275,339 mili-second.
275339 / 60 = 4588.98333 = 5 minute ( 11 job )
==================================================
input : fl3ad1qjreg , 9kwv2xsxzhk , dr9fdg4vnby , hj538h_kzci , v9zqqr8vfxg , 7foljg6r-k0 , r1hezwdmhaw , fbdry0utyam , oseyoavskxa , rq5zas9m3tc , 9tzga6qaaba , xvfbtsuscgq , 2huzlhq15pe , 3hf5jhl48-u , vb3rd72grpk , q_rifpheywy , mw30cgaxiqw , mp9ifhllt4c , z4q_u5h0ub8 , rk5pxe5kkb4 , irsfubpok3u , qzjoni5fi00
start processing , current-time: 20-oct-2023 15:43:56 utc-5.
finished processing , current-time: 20-oct-2023 15:54:59 utc-5 , time-duration-amount spent : 663,146 mili-second.
663146 / 60 = 11052.4333 = 11 minute ( 22 job )
==================================================
input : fl3ad1qjreg , 9kwv2xsxzhk , dr9fdg4vnby , hj538h_kzci , v9zqqr8vfxg , 7foljg6r-k0 , r1hezwdmhaw , fbdry0utyam , oseyoavskxa , rq5zas9m3tc , 9tzga6qaaba
time-amount-duration :
start processing , current-time: 20-oct-2023 14:23:19 utc-5.
finished processing , current-time: 20-oct-2023 14:25:50 utc-5 , time-duration-amount spent : 151,454 mili-second
151454 / 60 = 2524.2333 = 3 minute ( 11 job )
===============================================================
input : xvfbtsuscgq , 2huzlhq15pe , 3hf5jhl48-u , vb3rd72grpk , q_rifpheywy , mw30cgaxiqw , mp9ifhllt4c , z4q_u5h0ub8 , rk5pxe5kkb4 , irsfubpok3u , qzjoni5fi00
time-amount-duration :
start processing , current-time: 20-oct-2023 14:37:51 utc-5.
finished processing , current-time: 20-oct-2023 14:39:47 utc-5 , time-duration-amount spent : 115,799 mili-second.
115799 / 60 = 1929.98333 = 2 minute ( 11 job )
===============================================================
so maybe buying big-memory is : not (meaningfull/effective)-help , not creating big-profit which is enough to reimburse deficit-from-giving-money-in-exchange-for-big-memory ? maybe if big-memory has 70 % memory-consumption then cpu-ability-to-work-fast decrease ? but i realise this time-duration-result-benchmark is from computer-with-internal-video-card-which-is-located-inside-same-housing-as-cpu ( no stand-alone-video-card ) , so maybe memory-contention-problem become bigger if memory-consumption is big . ;;