Advertisement
Guest User

Untitled

a guest
Apr 25th, 2017
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.11 KB | None | 0 0
  1. <!DOCTYPE html>
  2. <html>
  3. <head>
  4. <meta charset=utf-8 />
  5. <title>JS Bin</title>
  6. </head>
  7. <body>
  8.  
  9. <script id="jsbin-javascript">
  10. //Write a JavaScript function that returns a passed string with letters in alphabetical order. Assume punctuation and numbers symbols are not included in the passed string.
  11.  
  12. function alphabet_order(str)
  13. {
  14.  
  15. return str.split('').sort().join('');
  16. }
  17.  
  18. console.log(alphabet_order("webmaster"));
  19.  
  20. function string2upper(stringus){
  21. //return stringus.split('').join('');
  22. stringus2=stringus.toUpperCase();
  23. console.log(stringus2);
  24. }
  25.  
  26. string2upper("hey yo nace");
  27.  
  28. function uppercase(str)
  29. {
  30. var array1 = str.split(' ');
  31. var newarray1 = [];
  32.  
  33. for(var x = 0; x < array1.length; x++){
  34. newarray1.push(array1[x].charAt(0).toUpperCase()+array1[x].slice(1));
  35. }
  36. return newarray1.join(' ');
  37. }
  38. console.log(uppercase("the quick brown fox"));
  39.  
  40. //Write a JavaScript function that accepts a string as a
  41. //parameter and find the longest word within the string.
  42. function theLongest(strongus){
  43.  
  44. var lgth = 0;
  45. var longest;
  46. var array1 = strongus.split(' ');
  47. for(var x = 0; x < array1.length; x++){
  48. if(array1[x].length > lgth){
  49. var lgth = array1[x].length;
  50. longest = array1[x];
  51. }
  52. }
  53. console.log(longest);
  54. }
  55. theLongest("go too faraway");
  56.  
  57. function find_longest_word(str)
  58. {
  59. var array1 = str.match(/\w[a-z]{0,}/gi);
  60. var result = array1[0];
  61.  
  62. for(var x = 1 ; x < array1.length ; x++)
  63. {
  64. if(result.length < array1[x].length)
  65. {
  66. result = array1[x];
  67. }
  68. }
  69. return result;
  70. }
  71. console.log(find_longest_word('Web Development Tutorial'));
  72. </script>
  73.  
  74.  
  75.  
  76. <script id="jsbin-source-javascript" type="text/javascript">//Write a JavaScript function that returns a passed string with letters in alphabetical order. Assume punctuation and numbers symbols are not included in the passed string.
  77.  
  78. function alphabet_order(str)
  79. {
  80.  
  81. return str.split('').sort().join('');
  82. }
  83.  
  84. console.log(alphabet_order("webmaster"));
  85.  
  86. function string2upper(stringus){
  87. //return stringus.split('').join('');
  88. stringus2=stringus.toUpperCase();
  89. console.log(stringus2);
  90. }
  91.  
  92. string2upper("hey yo nace");
  93.  
  94. function uppercase(str)
  95. {
  96. var array1 = str.split(' ');
  97. var newarray1 = [];
  98.  
  99. for(var x = 0; x < array1.length; x++){
  100. newarray1.push(array1[x].charAt(0).toUpperCase()+array1[x].slice(1));
  101. }
  102. return newarray1.join(' ');
  103. }
  104. console.log(uppercase("the quick brown fox"));
  105.  
  106. //Write a JavaScript function that accepts a string as a
  107. //parameter and find the longest word within the string.
  108. function theLongest(strongus){
  109.  
  110. var lgth = 0;
  111. var longest;
  112. var array1 = strongus.split(' ');
  113. for(var x = 0; x < array1.length; x++){
  114. if(array1[x].length > lgth){
  115. var lgth = array1[x].length;
  116. longest = array1[x];
  117. }
  118. }
  119. console.log(longest);
  120. }
  121. theLongest("go too faraway");
  122.  
  123. function find_longest_word(str)
  124. {
  125. var array1 = str.match(/\w[a-z]{0,}/gi);
  126. var result = array1[0];
  127.  
  128. for(var x = 1 ; x < array1.length ; x++)
  129. {
  130. if(result.length < array1[x].length)
  131. {
  132. result = array1[x];
  133. }
  134. }
  135. return result;
  136. }
  137. console.log(find_longest_word('Web Development Tutorial'));
  138.  
  139.  
  140.  
  141. </script></body>
  142. </html>
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement